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
V Y:
20150521 19:01:29
If the number is even: result = str(foo(num/2))+'0'. But will this help? 

i_am_looser:
20150521 08:09:15
wow feeling good ..... Brilliant question : ) 

Mukesh Gupta:
20150507 13:21:00
problem can be solve without using bfs. hint: using complete binary tree 

Mukesh Gupta:
20150507 13:14:40
test cases are weak add 1998


happy:
20150428 14:08:19
stl string gives tle 

BRAIN:
20150415 16:10:10
7.42s with C++ ( cin, cout ) :ss . .......


Rajat (1307086):
20150405 13:05:23
Brilliant question. Just look at my history of submissions of this question:


vijay :
20150312 19:12:45
A Brilliant question . Guys jst do it urself. All the time will be worth.Dot 

Stanley:
20150118 22:56:32
I cant solve it... The only way i know is making a list with all numbers with ones and zeros... I only know C :( Last edit: 20150119 00:36:46 

deepak garg:
20150205 17:51:43
good one! 
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 