E - Find The Multiple

最新推荐文章于 2020-02-27 02:15:47 发布

原创最新推荐文章于 2020-02-27 02:15:47 发布 · 178 阅读

0 ·

CC 4.0 BY-SA版权

深度优先搜索专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个编程问题：给定一个正整数n，如何找出一个非零倍数m，使得m的十进制表示中只包含0和1这两个数字。文章提供了一种使用深度优先搜索算法来解决该问题的方法，并通过示例输入输出展示了程序运行效果。

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

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

Sample Output

10
100100100100100100
111111111111111111

#include <iostream>
#include <queue>

using namespace std;
int n,flag;
void dfs(long long cur,int step)
{
    if(step == 19 || flag) return;///当m为19位时，会超出longlong的范围类型
    if(cur % n == 0)
    {
        flag = 1;
        cout << cur << endl;
        return;
    }
    dfs(cur*10,step+1);///两种的选择，增加1或者0
    dfs(cur*10+1,step+1);
}

int main()
{
    while(cin>>n&&n)
    {
        flag = 0;
        dfs(1,0);///开始的时候，m只能是1，并且增加的位数是0