POJ 1426 DFS BFS两种写法

Description

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

#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>
#include <map>
#define ll long long
#include<cstdio>
using namespace std;
queue<ll> q;
ll n;
ll ans = 3222222222222222222;
ll dfs(ll x)
{      
    if(x>3222222222222222222||x<0)    return 0;
    if(x%n==0)                   //找到一个结果快速返回
    {
        cout<<x<<endl;            
        return 1;
    }
    if(dfs(x*10)   ) return 1;
   if( dfs(x*10+1))  return 1;
    return 0;
}
int main()
{

    while(cin>>n&&n)
    {
        dfs(1);
    }
    return 0;
}

#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>
#include <map>
#define ll long long
#include<cstdio>
using namespace std;
queue<ll> q;
ll n;
ll bfs(ll x)
{
    while(!q.empty()) q.pop();
    q.push(x);
    while(!q.empty())
    {
        ll tmp = q.front();
        q.pop();
        if(tmp%n==0)
            return  tmp;
        q.push(tmp*10);
        q.push(tmp*10+1);
    }
}
int main()
{

    while(cin>>n&&n)
    {
        cout<<bfs(1)<<endl;
    }
    return 0;
}