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
思路:
结果要输出能被n整除的不包含除0,1外的数,可以用bfs也可以用dfs,搜索可以被n整除的数,形式为longlong
代码实现:
(bfs)
#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
typedef long long ll;
int n;
void bfs(ll m)
{
queue<ll> p;
p.push(m);
while(p.size())
{
ll temp=p.front();
p.pop();
if(temp%n==0)
{
cout<<temp<<endl;
break;
}
p.push(temp*10);
p.push(temp*10+1);
}
}
int main()
{
while(scanf("%d",&n),n)
{
bfs(1);
}
return 0;
}
(dfs)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
const int N=1000;
typedef long long ll;
int n;
bool flag;
void dfs(int level,ll m)
{
if(level>19 || flag==true)
{
return ;
}
if(m%n==0)
{
cout<<m<<endl;
flag=true;
return ;
}
dfs(level+1,m*10);
dfs(level+1,m*10+1);
}
int main()
{
while(scanf("%d",&n),n)
{
flag=false;
dfs(1,1);
}
return 0;
}