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
题意:输入一个数n,求只有0/1的n的倍数,如果有多个,输出任意一个
1.本题200位以内,实际 long long 即可
2.本题不会出现重复情况,不用标记
ac代码
# include <iostream>
# include <queue>
# include <cstring>
using namespace std;
queue <long long> dp;
int main ()
{
int b;
while (cin >> b&&b)
{
while (!dp.empty()) dp.pop();
dp.push(1);
while (!dp.empty())
{
long long a = dp.front();
dp.pop();
if (a%b==0)
{
cout << a <<endl; break;
}
if (a*10%b==0)
{
cout << a*10 << endl;
break;
}
if ((a*10+1)%b==0)
{
cout << a*10+1 << endl;
break;
}
dp.push(a*10);
dp.push(a*10+1);
}
}
return 0;
}