题目:
Find The Multiple
Time Limit: 1000MS | Memory Limit: 10000K | |||
Total Submissions: 30356 | Accepted: 12619 | 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
代码:
好久不写搜索手生了
队列每次开一个新的会TLE
放外边,直接用queue会MLE
手打队列开小了会RE 10^5太小
long long 数组开10^8并不会MLE....
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
long long n,ans,t,qu[100000000];
long long head,tail;
long long bfs(){
head=0,tail=1;
qu[0]=1;
while(head<tail){
t=qu[head++];
if(t%n==0) return t;
qu[tail++]=t*10;
qu[tail++]=t*10+1;
}
}
int main(){//8444K 110MS
ios_base::sync_with_stdio(false);
while(cin>>n&&n){
cout<<bfs()<<endl;
}
return 0;
}