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
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
typedef long long ll;
const int maxn= 100006;
#define cle(n) memset(n,0,sizeof(n))
const long long inf=1000000009;
using namespace std;
const int N = 100001;
ll n;
bool found;
void dfs(ll t,ll n,int k)
{
if(found)return;
if(k>=19)
return;
if(t%n==0)
{
cout<<t<<endl; found=true;
}
dfs(t*10,n,k+1);
dfs(t*10+1,n,k+1);
}
int main()
{
while(~scanf("%lld",&n),n)
{
found=false;
dfs(1,n,0);
}
return 0;
}
