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
AC代码(用bfs每次都模所以long long 不会爆)
Select Code
#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;
void bfs(int n)
{
queue<long long>q;
q.push(1);
while(!q.empty())
{
long long sm = q.front();
q.pop();
if(sm%n==0)
{
cout<<sm<<endl;
return;
}
q.push(sm*10);
q.push(sm*10+1);
}
return;
}
int main()
{
std::ios::sync_with_stdio(false);
int n;
while(cin>>n&&n)
{
bfs(n);
}
return 0;
}