POJ Find The Multiple 1426 (搜索)

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 using namespace std;
 6 int n;
 7 bool flag;
 8 unsigned long long  m;
 9 void dfs(unsigned long long  x,int k)
10 {
11     cout<<x<<endl;
12     if(flag)
13         return;
14     if(x%n==0)
15     {
16         flag=1;
17         m=x;
18         return;
19     }
20     if(k==19)
21         return;
22     dfs(x*10,++k);
23     dfs(x*10+1,k);
24     return;
25 }
26 int main()
27 {
28     int i,j;
29     while(cin>>n&&n)
30     {    
31         flag=0;
32         dfs(1,1);
33         cout<<m<<endl;
34     }
35 }