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
Nongthonbam Tonthoi:
20141229 20:42:41
I will try later.


1yr:
20141225 21:26:14
no need of even string/vector 

Yash Kumar:
20141024 17:26:56
I think others are misleading, can easily be solved using stl and strings 

Dario Sindicic:
20140725 14:03:15
190th :D 

Master_Mind:
20140620 18:50:46
getting wa.


Archit Jain:
20140617 09:03:36
dont use stl...!!


candide:
20140521 12:20:33
@Anubhav Bindlish


Anubhav Bindlish:
20140521 07:45:51
Will the answer fit in 64 bit integer? 

californiagurl:
20140310 17:38:27
modular maths FTW :D (y) !!!!


Somesh Maurya™:
20140121 18:38:58
ans for 19998?? 
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 