poj 1426 Find The Multiple dfs

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 25295   Accepted: 10413   Special Judge 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 Source Dhaka 2002 水dfs ACcode： #include <cstdio> #define ll long long unsigned long long t=1; using namespace std; bool flag; void dfs(int a,unsigned long long b,int cnt){ if(cnt==19||!flag)return ; if(b%a==0){ flag=false; printf("%I64u\n",b); return; } dfs(a,b*10,cnt+1); dfs(a,b*10+1,cnt+1); } int main(){ int a; while(~scanf("%d",&a),a){ flag=true; dfs(a,t,0); } return 0; }

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

---

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xi