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.
Sample Input
2
6
19
0
Sample Output
10
100100100100100100
111111111111111111 题意很明确；输入一个数，输出这个数的哟个整倍数，输出的数必须只有0和1组成；我会告诉你这题Special Judge??
题目不是很难，用 long long +bfs(其实无所谓用不用）266ms 水过；
#include<queue>
#include<cstdio>
using namespace std;
int N;
void bfs()
{
long long i,q,p=;
queue<long long>que;
que.push(p);
while(!que.empty())//简单BFS
{
p=que.front();
que.pop();
for(i=;i<;i++)//因为只有 0和1
{
q=*p+i;
if(q%N==)
{
printf("%lld\n",q);
return ;
}
que.push(q);
}
}
}
int main()
{
int a,b;
while(scanf("%d",&a)&&a)
{
if(a==)//1有点特殊，所以单独处理；
{
printf("1\n");
continue;
}
N=a;
bfs();
}
return ;
}