Practice
Resources
Contests
Online IDE
New
Free Mock
Events New Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Events
Attend free live masterclass hosted by top tech professionals
New
Scaler
Explore Offerings by SCALER

# Jackpot queries

Problem Description

You are visiting a fair in byteland. You are shopping and want to buy Q items. Each item cost exactly B[i] amount of money.

You have no money but you have a magical bag on which you can apply an operation any times you want.

In bag there are N integers denoted by array A.

In one operation, You choose two integer X Y from A and deposit all of the amount of money M you have, this will magically increase your money by X ⊕ Y.

Note: You have to deposit all money you have otherwise you will be exiled from Byteland for your greed. Also, shopkeepers have no change, So you have to pay exact amount. :p

Treating each item as independent and starting with 0 amount of money, Can you find if we can buy each item?

Problem Constraints
2 ≤ N ≤ 1000
1 ≤ A[i] ≤ 10000
1 ≤ Q ≤ 100000
0 ≤ B[i] ≤ 109

Input Format
First argument contains an integer array A of size N. Second argument contains an integer array B of size Q.

Output Format
Return a binary string of size Q containing ith as 1 if its possible to buy ith item else 0.

Example Input
Input 1:

``````A = [1, 2], B = [3, 5, 10, 15]
``````

Input 2:

``````A = [1, 2, 3], B = [1, 5, 10]
``````

Example Output
Output 1:

``````"1001"
``````

Output 2:

``````"111"
``````

Example Explanation
Explanation 1:

``````
Note if same number are choosen then xor is 0 so only way to increase is by 3 (1 xor 2). So, all multiple of 3 can be paid off.
``````

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
Hints
• Hint 1
• Solution Approach
• Complete Solution

## Discussion

Free Mock Assessment
Fill up the details for personalised experience.
Phone Number *
OTP will be sent to this number for verification
+1 *
+1
Change Number
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
*Enter the expected year of graduation if you're student
Current Employer
Company Name
College/University Name
Job Title
Job Title
Software Development Engineer (Backend)
Software Development Engineer (Frontend)
Software Development Engineer (Full Stack)
Data Scientist
Android Engineer
iOS Engineer
Devops Engineer
Support Engineer
Research Engineer
Engineering Intern
QA Engineer
Co-founder
SDET
Product Manager
Product Designer
Backend Architect
Program Manager
Release Engineer