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.
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.
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.
2 6 19 0
10 100100100100100100 111111111111111111
题目的意思是说输入一个数,用0和1表示一个十进制数可以整除输入的数。
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
ll n;
void dfs()
{
queue<long long>q;
ll pre;
pre=1;
q.push(pre);
while(!q.empty()){
pre=q.front();
q.pop();
if(pre%n==0){
cout<<pre<<endl;
return ;
}
q.push(pre*10);
q.push(pre*10+1);
}
}
int main()
{
ios::sync_with_stdio(false);
while(cin>>n&&n){
dfs();
}
return 0;
}