poj-1456 Find The Multiple 深搜

  Find The Multiple

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

题意：给你一个数n，让你求只有0,1，表示的十进制的数且这个数能整除n。

思路：深搜，深搜是对0搜或者对1搜，步数加一，注意深搜结束条件，以及注意深搜结束的条件答案不一定是输出样例的答案只要符合条件即可。

#include<stdio.h>
#include<string.h>
int n,flag;
void dfs(long long int x,int step)
{
    if(flag||step>18)//剪枝
        return ;
    if(x%n==0&&x)//搜索结束条件
    {
        flag=1;		//标记
        printf("%lld\n",x);
        return ;
    }
    dfs(x*10,step+1);//对0搜
    dfs(x*10+1,step+1);//对1搜
}
int main()
{
    while(scanf("%d",&n)&&n)
    {
        flag=0;
        dfs(1,0);
    }
    return 0;
}