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
tni_mdixit:
20161025 14:39:02
really ,cool logic! though i couldn't crack :P


piyush9620:
20161016 18:16:41
instead of using bfs, we can use a counter. counter is basically a number counter.


rohitranjan017:
20160903 16:51:31
BFS + Backtracking !


Sarthak Munshi:
20160902 17:55:18
storing string or integer is trivial . Just store the remainder of leftchild%n and rightchild%n and check each of those to be 0 . 

sonupmandal:
20160819 12:39:17
backtracking :) Last edit: 20160819 12:56:01 

vaibhavi760:
20160814 12:39:19
weak test cases


malibarbar:
20160812 19:26:40
Got AC in one, 0,98


a_thinker:
20160714 13:26:43
@candide how would that make a difference if we do bfs ending with the left most digits or bfs ending with the right most digits ? 

invincible_rm:
20160705 19:41:32
Used the Queue n the Modulo(n states) n Backtracked for number


ajay_5097:
20160526 17:13:42
easy one !! 2nd on bfs ! :)

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