Description
Input
Output
Sample Input
2 6 19 0
Sample Output
10 100100100100100100 111111111111111111
#include"cstdio" using namespace std; int n; unsigned long long ans; bool flag; void dfs(unsigned long long i,int k) { if(flag) return; //找结果之后就直接返回 if(i%n==0) { flag=true; ans=i; return; } if(k==19) return; //答案在19为之内,无符号long long 可以保存结果 dfs(i*10+0,k+1); dfs(i*10+1,k+1); } int main() { while(scanf("%d",&n)!=EOF&&n!=0) { flag=false; dfs(1,0); printf("%llu\n",ans); } return 0; }
原文:http://www.cnblogs.com/program-ccc/p/5002010.html