D - 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 <queue>
#define ll long long
using namespace std;
int n;
void bfs(int t) //交G++才AC
{
queue<ll>q;
q.push(t);
while(!q.empty())
{
ll now=q.front();q.pop();
if(now%n==0)
{
printf("%lld\n",now);
return ;
}
q.push(now*10);
q.push(now*10+1);
}
}
int main()
{
while(scanf("%d",&n)&&n!=0)
{
bfs(1);
}
return 0;
}
/*******/
#include <stdio.h>
#define ll long long
int n,flag;
void dfs(ll x,int cn)
{
if(cn>19||flag==0) return ;
if(x%n==0)
{
flag=0;
printf("%lld\n",x);
return ;
}
dfs(x*10,cn+1);
dfs(x*10+1,cn+1);
}
int main()
{
while(scanf("%d",&n)&&n!=0)
{
flag=1;
dfs(1,1);
}
return 0;
}