0、1整除

https://vjudge.net/contest/65959#problem/E

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.

题意：找出任意一个由0和1组成的数，而且是n的倍数。unsigned __int64可以存下结果，循环深度<20;

两条搜索路径---t*10;t*10+1;

1. #include<iostream>  
2. #include<cstdio>  
3. #include<cstring>  
4. #include<algorithm>  
5. using namespace std;  
6. bool vis;  
7. int n;  
8. void dfs(unsigned __int64 x,int n,int k){  
9.     if(vis) return;  
10.     if(x%n==0){  
11.         printf("%I64u\n",x);  
12.         vis=true;  
13.         return;  
14.     }  
15.     if(k==19) return;  
16.     dfs(x*10,n,k+1);  
17.     dfs(x*10+1,n,k+1);  
18. }  
19. int main(){  
20.     while(scanf("%d",&n)){  
21.         if(n==0) break;  
22.         vis=false;  
23.         dfs(1,n,0);  
24.     }  
25.     return 0;  
26. }