题目:
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 0Sample Output
10 100100100100100100 111111111111111111
思路:一开始一直在考虑大数据的运算,把数字放入数组然后分别%什么的。。很麻烦。然后问了一下度娘发现并不会超过long long int。于是就放心了= =分两种情况考虑,一个是*10,一个是*10+1;但是我一直超时。。
代码:
#include<iostream>
#include<queue>
#include<cstring>
#include<cstdio>
typedef __int64 ll;
using namespace std;
void bfs(int a)
{
ll s;
s=1;
queue<ll>q;
q.push(s);
int t=0;
while(q.size())
{
ll ss=q.front();
q.pop();
if(ss%a==0){printf("%I64d\n",ss);return;}
q.push(ss*10+1);
q.push(ss*10);
}
}
int main()
{
int a;
while(scanf("%d",&a))
{
if(a==0)break;
else bfs(a);
}
return 0;
}