D - Find The Multiple（dfs）

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

这道题目刷新了我的观念，连样例都过不了的代码，也可以AC~
（因为这道题目的意思是，输入一个数，然后输出只含有0和1的数字，并且是输入的数的倍数，当然，随意一个都可以~）

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int flag;
int n;
void dfs(unsigned __int64 a, int n, int k)//long long 都存不了~，64位整型
{
    if(flag)//如果找到了，返回
        return;
    if(a%n==0)//看看是否可以被n整除
    {
        printf("%I64u\n", a);
        flag = 1;//标记
        return ;
    }
    if(k==19)
        return ;//不能超过19位
    //两条路径，每次寻找到的时候，增加一位数字，要么为0，要么为1
    dfs(a*10, n, k+1);//增加0
    dfs(a*10+1, n, k+1);//增加1
}
int main()
{
    while(~scanf("%d", &n)&&n)
    {
        flag = 0;
        dfs(1, n, 0);//搜索
    }
    return 0;
}