Find The Multiple
Time Limit: 1000MS | Memory Limit: 10000K | |||
Total Submissions: 17799 | Accepted: 7207 | 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
#include<iostream>
using namespace std;
long long a[10000000];
int main(){
int n;
long long ans;
while(cin>>n,n){
int top=0;
int rear=0;
a[rear++]=1;
while(1){
ans=a[top++];
if(ans%n==0){
break;
}
a[rear++]=ans*10;
a[rear++]=ans*10+1;
}
cout<<ans<<endl;
}
return 0;
}
题目是要求n的整数倍的数,并且这个数只能包含0和1.
用stl超时了
AC代码: