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
yashgulani: 2017-11-07 21:20:34

test cases are weak , there is no test case having n=1 boundary condition . Please improve the test case for this particular question .

aditya930: 2017-10-20 15:47:04

getting WA can someone help wrong answer code is

vishesh197: 2017-10-17 17:11:10

did it using bfs ......but used modular arithmetic for checking took me 5.44sec but AC in first go.Can anybody help me with my implementation....

nadstratosfer: 2017-10-17 10:37:54

If you come here to practice BFS, look elsewhere. It's basically a bruteforce trial division over binary-looking numbers. People raving about smart-sounding acronyms here remind me of binmen calling themselves "environmental officers".

rohit1507: 2017-09-20 13:28:01

Fcking awesome!!! Question worth giving time!

matcha1998: 2017-09-18 08:12:02

Excellent one!!

samanwaya: 2017-07-04 10:21:31

just wondering how broad is breadth first search.....!!!!

babur: 2017-06-27 07:02:14

Weak Test Cases....

himmi97: 2017-06-07 11:10:13

weak test cases..try 999 and 9999.
For 999 answer is 111111111111111111111111111

Last edit: 2017-06-07 11:11:41
codervrinda: 2017-05-25 13:30:33

@vipul_8 check for larger numbers...
check your code for test case:

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