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
就是一个数,找到它的倍数,这个倍数只有0和1两个数字。第一反应看到样例就知道纯暴力很蛋疼,但是很明了,只有0,1,那么直接*10+1或者*10就好了,然后一顿搜索,吸取教训,所有量全是longlong,不能再被坑。
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
long long ans;
long long leap;
void bfs(long long x, int y, int z)
{
if (z < 19&&!leap){
if (x%y == 0)
{
ans = x;
leap = 1;
}
else
{
bfs(x * 10, y, z + 1);
bfs(x * 10 + 1, y, z + 1);
}
}
}
int main()
{
long long i, j, m, n;
while (scanf("%d", &n) != EOF){
if (!n)break;
leap = 0;
bfs(1, n, 0);
cout << ans << endl;
}
return 0;
}