1426 [kuangbin带你飞]专题一简单搜索 E

yqdjl6

于 2017-07-21 23:54:35 发布

阅读量183

点赞数

分类专栏： Vjudge Poj

本文链接：https://blog.youkuaiyun.com/yqdjl6/article/details/75675904

版权

Vjudge 同时被 2 个专栏收录

23 篇文章

订阅专栏

Poj

9 篇文章

订阅专栏

本文介绍了一个编程挑战，即给定一个正整数n，如何找到一个n的倍数m，且m的十进制表示中只包含0和1。文章提供了使用C++实现的解决方案，并附带了示例输入输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

#include<queue>
#include<cstdio>
using namespace std;

int main()
{
    int n;
    while(scanf("%d",&n)&&n) {
        queue<long long>Q;
        Q.push(1);
        while(!Q.empty()) {
            long long x=Q.front();
            Q.pop();
            if(x%n==0) {
                printf("%lld\n",x);
                break;
            }
            Q.push(x*10);
            Q.push(x*10+1);
        }
    }
    return 0;
}