POJ - 1426 Find The Multiple （dfs）

Find The Multiple

Descriptions:

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

题目链接：
https://vjudge.net/problem/POJ-1426

题解：
所求得的数只含有1或0，所以从1开始深搜，两个方向（n * 10） 或者（n * 10+1）。dfs终止条件：找到那个数或者这个数的长度大于19。

AC代码

#include <iostream>
using namespace std;
int n,flag;
void dfs(int step,long long y)//step为数的长度，y为要寻找的数
{
    if(step>19 || flag==1)//利用flag保证找到这个数的时候终止
        return;
    if(y%n==0)
    {
        flag=1;
        cout << y << endl;
        return;
    }
    dfs(step+1,y*10);
    dfs(step+1,y*10+1);
}
int main()
{
    while(cin >> n)
    {
        if(n==0)
            break;
        flag=0;
        dfs(1,1);//从1开始深搜，初始阶段长度为1
    }
    return 0;
}