POJ-1426-Find The Multiple （dfs搜索）

原题链接：
http://poj.org/problem?id=1426
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
题意：
给出一个200以内的整数n，输出n的倍数，且 此倍数只能由0或1组成。
题解：
深度优先搜索，每一次都把数字乘以十倍，加一或加0，就能够达到搜索到所有的目标。
附上AC代码：

#include <iostream>
#include <cstdio>
using namespace std;
int n,flag;
void dfs(unsigned __int64 x,int len)
{
   if(flag) return;
   if(x%n==0)//满足题意
   {
     cout<<x<<endl;
     flag=1;
     return;
   }
   if(len==19) return;
   dfs(x*10,len+1);//搜索到所有的目标
   dfs(x*10+1,len+1);
}
int main()
{
  while(cin>>n,n)
  {
    flag=0;
    dfs(1,0);//第一个为起始位置，第二个为搜索层数
  }
  return 0;
}

欢迎评论！