Find The Multiple【广搜】

Find The Multiple

 POJ - 1426 

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的倍数且仅有1和0组成

方法：从1,0开始广搜，直到找到倍数为止，有多个答案，输出其中一个即可。

AC代码

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <set>
#include <utility>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define lep(i,l,r) for(int i=l;i>=r;i--)
#define ms(arr) memset(arr,0,sizeof(arr))
//priority_queue<int,vector<int> ,greater<int> >q;
const int maxn = (int)1e6 + 5;
const ll mod = 1e9+7;
int arr[maxn];
int main() 
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(0),cin.tie(0);
    int n;
    while(cin>>n&&n)
    {
    	int i,j;
    	arr[1]=1;
    	for(i=2;arr[i-1]!=0;i++)
    		arr[i]=(arr[i/2]*10+i%2)%n;
    	i--;
    	j=1;
    	while(i) {
    		arr[j++]=i%2;
    		i=i/2;
    	}
    	while(--j) 
    		cout<<arr[j];
    	cout<<endl;
    }

    return 0;
}