ONEZERO  Ones and zeros
Certain positive integers have their decimal representation consisting only of ones and zeros, and having at least one digit one, e.g. 101. If a positive integer does not have such a property, one can try to multiply it by some positive integer to find out whether the product has this property.
Input
Number K of test cases (K is approximately 1000);
in each of the next K lines there is one integer n (1 <= n <= 20000)
Output
For each test case, your program should compute the smallest multiple of the number n consisting only of digits 1 and 0 (beginning with 1).
Example
Input: 3 17 11011 17 Output: 11101 11011 11101
hide comments
yashgulani:
20171107 21:20:34
test cases are weak , there is no test case having n=1 boundary condition . Please improve the test case for this particular question . 

aditya930:
20171020 15:47:04
getting WA can someone help wrong answer code is https://ideone.com/SMd9dj 

vishesh197:
20171017 17:11:10
did it using bfs ......but used modular arithmetic for checking remainder....it took me 5.44sec but AC in first go.Can anybody help me with my implementation.... 

nadstratosfer:
20171017 10:37:54
If you come here to practice BFS, look elsewhere. It's basically a bruteforce trial division over binarylooking numbers. People raving about smartsounding acronyms here remind me of binmen calling themselves "environmental officers". 

rohit1507:
20170920 13:28:01
Fcking awesome!!! Question worth giving time! 

matcha1998:
20170918 08:12:02
Excellent one!!


samanwaya:
20170704 10:21:31
just wondering how broad is breadth first search.....!!!! 

babur:
20170627 07:02:14
Weak Test Cases.... 

himmi97:
20170607 11:10:13
weak test cases..try 999 and 9999.


codervrinda:
20170525 13:30:33
@vipul_8 check for larger numbers...

Added by:  PaweÅ‚ Dobrzycki 
Date:  20050526 
Time limit:  8s 
Source limit:  4096B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:  II Polish Olympiad in Informatics, Ist Stage 