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

Code

/*
 * @Description: 
 * @version: 
 * @Author: 
 * @Date: 2021-04-14 14:04:42
 * @LastEditors: Please set LastEditors
 * @LastEditTime: 2021-04-14 19:08:10
 */
// self，该程序是借鉴了网络的大数计算余数的算法
#include <iostream>
#include <climits>
#include <string>
#include <queue>
using namespace std;
int n;
bool check(string str)
{
    int ans = 0;
    for (int i = 0; i < str.length(); i++)
        ans = ((ans * 10) + (str[i] - '0')) % ::n;
    if (ans == 0)
        return true;
    return false;
}
string BFS()
{
    queue<string> q;
    string temp = "1";
    q.push(temp);
    while (true)
    {
        // 如果队头字符串长度已经超过了100，则停止
        if (q.front().length() > 100)
            break;
        // 找到一个解停止
        if (check(q.front()))
            break;
        q.push(q.front() + "1");
        q.push(q.front() + "0");
        q.pop();
    }
    return q.front();
}
int main()
{
    while (cin >> n && n != 0)
    {
        cout << BFS() << endl;
    }
    system("pause");
    return 0;
}
// 提交一次