Sphere Online Judge



SPOJ Problem Set (classical)

370. Ones and zeros

Problem code: ONEZERO

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.

Input

Number K of test cases (K is approximately 1000);
in each of the next K lines there is one integer n (1 <= n <= 20000)

Output

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

Example

Input:
3
17
11011
17
Output:
11101
11011
11101

Added by:Paweł Dobrzycki
Date:2005-05-26
Time limit:8s
Source limit:4096B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: NODEJS PERL 6 SCM chicken VB.net
Resource:II Polish Olympiad in Informatics, Ist Stage

hide comments
2015-01-18 22:56:32 Stanley
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
2015-01-18 10:01:00 deepak garg
good one!
2015-01-17 18:47:03 SHUBHAM PANDEY
My 50th!!!!!!
2015-01-17 18:40:04 Samar Holkar


Last edit: 2015-01-17 18:40:23
2015-01-03 09:51:54 Dhawal Harkawat
for those getting WA.. ->
please note that unsigned long long int would not help here..
2014-12-29 20:42:41 Nongthonbam Tonthoi
I will try later.


Last edit: 2014-12-29 20:47:09
2014-12-25 21:26:14 1yr
no need of even string/vector
2014-10-24 17:26:56 Yash Kumar
I think others are misleading, can easily be solved using stl and strings
2014-07-25 14:03:15 Dario Sindičić
190th :-D
2014-06-20 18:50:46 Master_Mind
getting wa.
any specific reasons plzz reply
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.