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
打表。。。
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include <iostream> 2 #include <cstdio> 3 #include <queue> 4 #include <cstring> 5 6 using namespace std; 7 8 struct node{ 9 int mod; 10 char str[40]; 11 int cou; 12 }; 13 14 char ans[205][20]; 15 int i; 16 17 void bfs(int n){ 18 queue<node> que; 19 node t; 20 t.mod=1; 21 t.cou=0; 22 t.str[t.cou++]='1'; 23 24 que.push(t); 25 while(!que.empty()){ 26 node now=que.front(); 27 que.pop(); 28 if(now.mod%n==0){ 29 now.str[now.cou]='