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
题目大意:给出一个数,找到他的只有1和0的倍数。dfs。
题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=15205
源代码:
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string.h>
#include <stack>
#include <vector>
using namespace std;
long long n;
long long ans;
int flog=0;
void dfs(long long sum,int deep)
{
if(flog||deep>18)
return ;
if(sum%n==0)
{
flog=1;
ans=sum;
return ;
}
dfs(sum*10,deep+1);
dfs(sum*10+1,deep+1);
}
int main()
{
while(~scanf("%lld",&n)&&n)
{
ans=0;
flog=0;
dfs(1,0);
printf("%lld\n",ans);
}
return 0;
}