poj1426 Find The Multiple 题解

最新推荐文章于 2020-01-13 10:53:20 发布

SDUT_wdc

最新推荐文章于 2020-01-13 10:53:20 发布

阅读量841

点赞数

分类专栏： ACM算法

本文链接：https://blog.csdn.net/SDUTACM/article/details/50591876

版权

ACM算法专栏收录该内容

21 篇文章 0 订阅

订阅专栏

Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 23557		Accepted: 9723		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

Sample Output

10
100100100100100100
111111111111111111

Source

Dhaka 2002

题目大意：有多组数据，每组输入一个数，假设输入的数字为a，题目让你求一个数b, 这个数字b必须满足两个条件：（1） b%a=0 （ 2）数字b的每个位上的数字必须是0或者1，个人比较喜欢BFS，其实这道题用深搜也挺方便。下面是我的bfs代码，数据比较大，定义long long类型

上代码：

#include <iostream>
#include<string.h>
#include<queue>
#define LL long long
using namespace std;
int n,flag;
void bfs(LL x)
{
    LL s;
    int i;
    queue<LL>q;
    while(!q.empty())
        q.pop();
    q.push(x);
    while(!q.empty())
    {
        LL xx=q.front();
        q.pop();
        if(xx%n==0)
        {
            cout<<xx<<endl;
            return;
        }
        for(i=0; i<=1; i++)
        {
            if(i==0)
            {
                s=xx*10;
            }
            else s=xx*10+1;
            q.push(s);

        }
    }
}
int main()
{
    while(cin>>n&&n)
    {
        bfs(1);
    }
    return 0;
}