题目：
| Find The Multiple| Time Limit: 1000MS | | Memory Limit: 10000K | | |
| ---------------------------- | - | ------------------------ | - | ------------- |
| Total Submissions: 28608 | | Accepted: 11850 | | Special Judge |DescriptionGiven 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.InputThe 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.OutputFor 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 Input2 6 19 0Sample Output```
10 100100100100100100 111111111111111111
| ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | - | - | - | - |
\[[Submit](http://poj.org/submit?problem_id=1426)] \[Go Back] \[[Status](http://poj.org/problemstatus?problem_id=1426)] \[[Discuss](http://poj.org/bbs?problem_id=1426)]
代码：
```cpp
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int n,flag;
void dfs(long long s,int i)
{
if(i>=19||flag)return;
if(s%n==0)
{
printf("%lld\n",s);
flag=1;
return;
}
dfs(s*10,i+1);
dfs(s*10+1,i+1);
}
int main()
{
while(scanf("%d",&n)&&n)
{
flag=0;
dfs(1,0);
}
return 0;
}
代码应该都能看懂，就不注释了，广搜版的不会写，深搜版的容易理解
