POJ 1426 Find The Multiple

Find The Multiple

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33048 Accepted: 13830 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

26190

Sample Output

10100100100100100100111111111111111111

题目大意：给你一个数字，要你找出能整除它的一个数，这个数只有0和1组成

水题，用队列，这算是广搜吗？不知道

#include<iostream>#include<queue>#include<cstdio>using namespace std;int num;typedef long long ll;queue<ll> que;void bfs(){que.push(1);while(1){ll hehe=que.front();que.pop();if(hehe%num==0){cout<<hehe<<endl;return;}que.push(hehe*10);que.push(hehe*10+1);}}int main(){while(~scanf("%d",&num)&&num){while(!que.empty()) que.pop();bfs();}}