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



hide comments
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

vijay : 2015-03-12 19:12:45

A Brilliant question . Guys jst do it urself. All the time will be worth.Dot

Stanley: 2015-01-18 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: 2015-01-19 00:36:46
deepak garg: 2015-02-05 17:51:43

good one!

Added by:PaweĊ‚ Dobrzycki
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