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
问题讲述:输入一个数n,找出一个十进制数(只含有1和0),并且此数可被n整除。
问题思路:用BFS,因为只包含0和1,所以需要从两方面进行dfs运算:
(dfs(x10,n,s+1)和dfs(x10+1,n,s+1))
#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int vis;
void dfs(unsigned __int64 x, int n, int s)
{
if (vis) return;
if (x%n == 0)
{
printf("%I64u\n", x);
vis = 1;
return;
}
if (s == 19) return;//19次方的运算超过了范围
dfs(x * 10, n, s + 1);
dfs(x * 10 + 1, n, s + 1);
}
int main()
{
int n;
while (~scanf("%d", &n) && n)
{
vis = 0;
dfs(1, n, 0);
}
return 0;
}