poj 1426 Find The Multiple（简单DFS）

传送门
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

题意： 输出一个数的倍数，这个倍数满足只由1和0构成（但仍然是十进制）。

#include <iostream>
#include <algorithm>
using namespace std;
int flag;

void DFS(int a,unsigned long long b, int k){
    if (flag) 
        return;
    if (b % a == 0) {
        flag = 1;
        cout << b << endl;
        return;
    }
    if (k == 19) return;//到了19层就回溯回去，走另一条路
    DFS (a, b * 10, k + 1);//b有两种方式可以获取，一个是b*10，一个是b*10+1
    DFS (a, b * 10 + 1, k + 1);
}

int main(){
    int n;
    while (~scanf ("%d", &n)&&n) {
            flag = 0;
            DFS (n, 1, 0);
    }
    return 0;
}