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，找出一个数要求是n的倍数，并且这个数的十进制只由1和0组成，明显这样的数不止一个（如果，满足条件一定会有m×10也满足，故不止一种）

题目要求输出任意一个满足该条件的m
对于数据1，可知2×5=10，故答案可以得出是10（当然，100，1000…也满足，但是special judge，只用输出一个满足条件的解），其他数据也同理。
了解64位无符号整数可以存下结果，过可以用深搜如果搜到m则输出，否则搜索m×10和m×10+1直到得出答案

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
bool f;
int n;
void dfs(unsigned __int64 t,int n,int k)
{
	if(f) return ;
	if(t%n==0)
	{
		printf("%I64u\n",t);
		f=true;
		return ;
	}
	if(k==19) return ;
	dfs(t*10,n,k+1);
	dfs(t*10+1,n,k+1);
}
int main()
{
	while(cin>>n,n)
	{
		f=false;
		dfs(1,n,0);
	}
}