ONEZERO - Ones and zeros

no tags 

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).



Added by:PaweĊ‚ Dobrzycki
Time limit:8s
Source limit:4096B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: NODEJS PERL 6 SCM chicken
Resource:II Polish Olympiad in Informatics, Ist Stage

hide comments
Mayank Ladia: 2015-06-23 00:48:13

Literally very weak test case....
I have printed "Pokemon" when n==1,
then too its accepting :p ....

Last edit: 2015-06-23 00:52:06
Shubham: 2015-06-11 15:34:08

learnt a lot....had to take some help..for the record long long will pass easily..test case r weak....dont use string ...:D

Saurabh Uttam: 2015-06-01 16:17:50

weak test case add 9999

V Y: 2015-05-21 19:01:29

If the number is even: result = str(foo(num/2))+'0'. But will this help?

i_am_looser: 2015-05-21 08:09:15

wow feeling good ..... Brilliant question : )

Mukesh Gupta: 2015-05-07 13:21:00

problem can be solve without using bfs. hint: using complete binary tree

Mukesh Gupta: 2015-05-07 13:14:40

test cases are weak add 1998

happy: 2015-04-28 14:08:19

stl string gives tle

BRAIN: 2015-04-15 16:10:10

7.42s with C++ ( cin, cout ) :-ss . .......
algorithm using bfs and a binary tree with any node is 0 and 1

Rajat (1307086): 2015-04-05 13:05:23

Brilliant question. Just look at my history of submissions of this question:
first submission on 30/06/2014
AC on 05/04/2015