POJ - 1426(Find The Multiple)DFS

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.
题目链接：http://poj.org/problem?id=1426

题意：给你一个数n，然后求出一个n的倍数且这个倍数只含0和1。

解题思路：直接深搜，找到就返回

#include <iostream>
using namespace std;
int n,vis=0;

void dfs(unsigned long long a, int n, int k)
{
	if (vis)
		return;
	if (a%n == 0)
	{
		cout << a << endl;
		vis = 1;
		return ;
	}
	if (k == 19)//unsign long long 最大也只有19位数
		return;
	dfs(a * 10, k + 1);
	dfs(a * 10 + 1, k + 1);
}



int main()
{
	while (cin >> n&&n)
	{
		vis = 0;
		if (n == 0)
			return 0;
		dfs(1, 0);
	}

}