题目:http://poj.org/problem?id=1426
给出一个数n, 1 <= n <= 200, 请找到一个n的一个倍数m,十进制下m由0,1组成,且位数小于100,请输出任意一个满足条件的m
bfs
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<queue>
using namespace std;
#define ll long long int
void bfs(int n)
{
queue<ll> q;
q.push(1);
while(!q.empty())
{
ll tmp = q.front(); q.pop();
if(tmp % n == 0)
{
printf("%lld\n", tmp);
break;
}
q.push(tmp * 10);
q.push(tmp*10 + 1);
}
}
int main()
{
ll n;
while(~scanf("%lld", &n)&& n)
{
bfs(n);
}
return 0;
}
dfs:由于dfs会一直往下执行,所以要设置一个终止条件depth,即搜了多少次,depth不太小就行。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#define ll long long int
using namespace std;
ll n, ans;
bool flag = false;
void dfs(ll num, int depth)
{
if(flag) return ;
if(depth == 19) return;
if(num % n == 0)
{
flag = true;
ans = num;
return;
}
dfs(num * 10, depth + 1);
dfs(num * 10 + 1, depth + 1);
}
int main()
{
while(cin >> n && n)
{
flag = false;
dfs(1, 0);
cout << ans << endl;
}
return 0;
}