Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there is a corresponding m containing no more than 100 decimal digits.
Input
The input file may contain multiple test cases. Each line contains a value of n (1 <= n <= 200). A line containing a zero terminates the input.
Output
For each value of n in the input print a line containing the corresponding value of m. The decimal representation of m must not contain more than 100 digits. If there are multiple solutions for a given value of n, any one of them is acceptable.
Sample Input
2
6
19
0
Sample Output
10
100100100100100100
111111111111111111
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<memory.h>
#include<algorithm>
typedef unsigned long long ull;
using namespace std;
ull n;
ull ans;
bool vis[1005];
void dfs(ull num,int depth) {
if (ans)return;
if (num%n == 0) {
ans = num;
return;
}
else {
if (depth == 19)return;
dfs(num * 10, depth + 1);
dfs(num * 10 + 1, depth + 1);
}
}
int main() {
while (cin >> n) {
if (n == 0)break;
ans = 0;
dfs(1, 0);
printf("%I64u\n", ans);
}
return 0;
}