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
ajay_5097: 2016-05-26 17:13:42

easy one !! 2nd on bfs ! :)

candide: 2016-05-16 01:58:46

@kartikay singh: "Wonder,how ppl did it in 0.00s??"

Response: I did using a bfs ending with the left most digits of the number we are asked for. On the contrary, the most common and intuitive bfs method ends with the right most digit, and even optimised the later bfs needs 0.03s or more. Perphaps there exists a more mathematical (and ad hoc) method.

Last edit: 2016-05-25 17:14:50
zdratcha: 2016-04-28 21:35:28

bfs and backtracking got me an AC :)

coderkoko: 2016-01-23 14:46:57

Can anyone help e out? why getting WA?

minhthai: 2016-01-12 12:01:40

very nice problem. that example tests though :v
for java, you need to optimize a bit your bfs

karan: 2015-12-29 10:01:35

weak test cases. try for 999 and 9999.

kshitij tripathi: 2015-12-26 21:21:39

Nice Problem :)

vipul grover: 2015-12-10 10:44:24

finally after so many attempts :)

aghori_sadhu: 2015-12-07 05:16:44


Shubham Garg: 2015-10-23 12:26:39

Used strings and queue and got accepted. But time taken was 4.02 seconds.

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