|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||256 MB||42||17||12||50.000%|
Given an integer N, what is the smallest positive integer X, whose representation in base 10 consists only of digits ’0’ and ’1’, such that X is divisible by N?
The first line of the input file starts with the integer T, the number of test cases (1 ≤ T ≤ 100). Each test case consists of a number N(1 ≤ N ≤ 300) on a line.
For each test case, output the smallest positive number X such that X is divisible by N and it contains only digits ’0’ and ’1’. Given the constraints, it is guaranteed that there always is a solution (for any positive N) and, in this problem, it will always fit into a 64-bit signed integer.
3 1 2 20
1 10 100