POJ - 1426 Find The Multiple（深搜）

Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 32518		Accepted: 13601		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

  题目大意：给出一个整数不超过200，求它任意一个只由1或0组成的数字（能整除给出的整数）。

  思路：

           用深搜进行寻找，先看目前的数字是否能整除那个整数，若能整除，则标记下来，再输出，若不能整除，再进行下一次搜索，怎么搜索？

            应该是目前的数字后添加个1或则0，即x*10+0或x*10+1，再将步数加一，

            注意unsigned __int64的范围，-(10^19)~(10^20)所以步数不能超过19次。

  

#include<stdio.h>
#include<string.h>
int f,n;
void dfs(unsigned __int64 x,int k)
{
    if(f) return;
    if(x%n==0)
    {
        printf("%I64u\n",x);//无符号整形
        f=1;
        return;
    }
    if(k==19) return;  //因为unsigned __int64的范围是-9223372036854775808~9223372036854775807(10^19)与0~18446744073709551615(10^20)
                       //为防止超出范围，循环深度应小于20
    dfs(x*10,k+1);       //当前数字有两种选择方案，即下一个数选1或选0
    dfs(x*10+1,k+1);
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
         f=0;
         dfs(1,0);//首位数字必须为1
    }
}