poj1426_kuagnbin带你飞专题一

Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 30659		Accepted: 12755		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

Source

Dhaka 2002

打表。。。

 #include <iostream>
 #include <cstdio>
 #include <queue>
 #include <cstring>

 using namespace std;

 struct node{
     int mod;
     char str[];
     int cou;
 };

 char ans[][];
 int i;

 void bfs(int n){
     queue<node> que;
     node t;
     t.mod=;
     t.cou=;
     t.str[t.cou++]='';

     que.push(t);
     while(!que.empty()){
         node now=que.front();
         que.pop();
         if(now.mod%n==){
             now.str[now.cou]='\0';
             //strcpy(ans[i],now.str);
             printf("%s,",now.str);
             return ;
         }
         node next=now;
         next.mod=(now.mod*)%n;
         next.str[next.cou++]='';
         que.push(next);
         next.mod=(now.mod*+)%n;
         next.str[next.cou-]='';
         que.push(next);
     }
 }

 int main()
 {
     int n;
     for(i=;i<=;i++){
         bfs(i);
     }

     while(scanf("%d",&n)&&n!=){
         printf("%s\n",ans[n]);
     }
     return ;
 }

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <queue>

 using namespace std;

 long long a[]={,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,};
 int main()
 {
     int n;
     while(scanf("%d",&n)&&n!=){
         printf("%lld\n",a[n]);
     }

     return ;
 }