广搜+打表 POJ 1426 Find The Multiple

POJ 1426   Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 25734		Accepted: 10613		Special Judge

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

 /*代码一：广搜加打表，速度极快，广搜每一位是0还是1，幸好题目的数据范围没有超过int*/
 /*---------------------*/
 #define N 200
 #include<iostream>
 using namespace std;
 #include<cstdio>
 #include<queue>
 queue<long long>que;
 int main()
 {
     freopen("1.out","w",stdout);
     for(int i=;i<=N;++i)
     {
         que.push();
         while(!que.empty())
         {
             long long x=que.front();
             que.pop();
             if(x%i==)
             {
                 cout<<x<<",";
                 break;
             }
             que.push(x*);
             que.push(x*+);
         }
         while(!que.empty()) que.pop();
     }
     return ;
 }
 /*-----------------------------------------------------------*/
 #include<iostream>
 using namespace std;
 long long ans[]={,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,};
 int main()
 {
     int n;
     while(cin>>n)
     {
         if(n==) break;
         cout<<ans[n]<<endl;
     }
     return ;
 }