B - 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

借助一个队列模拟01串，除了最高位不能是0 ，其余每一位只能是0或1，用 long long即可（本题答案不唯一，只要属于正确答案就可以通过）

#include <stdio.h>
#include <queue>
using namespace std;
long long a[210];
queue<long long> q;
void hash(int n){
	while(!q.empty()){
		q.pop();
	}
	q.push(1);
	while(!q.empty()){
		long long top=q.front();
		q.pop();
		if(top%n==0){
			printf("%lld\n",top);
			break;
		}
		q.push(top*10);
		q.push(top*10+1);
	}
}

int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		if(n==0){
			break;
		}
		hash(n);	
	}
	return 0;
}