描述
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.
输入
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.
输出
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.
样例输入
2
6
19
0
样例输出
10
100100100100100100
111111111111111111
此题意图在于给定一个200以内的整数,找到一个是200的倍数并且组成仅有1和0的十进制整数
本体算法较多,犹豫long long 型数存储位数足够题目要求 所以一种较低效率的方法就是搜索就是了遍历挨个
#include<iostream>
#include<cstdio>
int n;
long long q[9999999];
using namespace std;
void BFS()
{
int front,rear;
front=rear=0;
q[rear++]=1;
long long top;
while(rear>front)
{
top = q[front++];
if( top%n==0 )
break;
top *= 10;
q[rear++]=top;
q[rear++]=top+1;
}
printf("%lld\n",top);
}
int main()
{
while(scanf("%d",&n)&&n)
{
BFS();
}
return 0;
}