POJ 1426 Find The Multiple



Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 17950		Accepted: 7267		Special Judge

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
思路：此题用到同余模定理，因为n是比较小的，用bfs从最高位开始搜，最高位肯定是1，接下来的位可以为0或者1，搜的过程中记录次数，总次数的二进制数即为所求数
#include <cstdio>
#include <map>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <cmath>
#include <queue>
#include <string>
using namespace std;
int n,ans;
queue<int>q;
void bfs()
{
	ans=1;
	while(!q.empty())
	{
		q.pop();
	}
	q.push(1);
	while(!q.empty())
	{
		int temp=q.front();
		q.pop();
		q.push((temp%n*10%n)%n);
		ans++;
		if((temp%n*10%n)%n==0) return ;
		q.push((temp%n*10%n+1)%n);
		ans++;
		if((temp%n*10%n+1)%n==0)
		     return;
	}
}
void print(int a)
{
	if(a==0)
		return;
	print(a/2);
	printf("%d",a%2);
	return;
}
int main()
{
	while(scanf("%d",&n)&&n)
	{
		bfs();
		print(ans);
		printf("\n");
	}
	return 0;
}