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.
Number K of test cases (K is approximately 1000);
in each of the next K lines there is one integer n (1 <= n <= 20000)
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).
Input: 3 17 11011 17 Output: 11101 11011 11101
|Added by:||Paweł Dobrzycki|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: NODEJS PERL 6 VB.net|
|Resource:||II Polish Olympiad in Informatics, Ist Stage|
can someone help...how to solve this problem..
Literally very weak test case....
learnt a lot....had to take some help..for the record long long will pass easily..test case r weak....dont use string ...:D
weak test case add 9999
If the number is even: result = str(foo(num/2))+'0'. But will this help?
wow feeling good ..... Brilliant question : )
problem can be solve without using bfs. hint: using complete binary tree
test cases are weak add 1998
stl string gives tle
7.42s with C++ ( cin, cout ) :-ss . .......