poj1426——Find The Multiple（BFS）-白红宇

poj1426——Find The Multiple（BFS）

阅读量：2344 次

发布时间：2019-05-10

本文共 1118 字，大约阅读时间需要 3 分钟。

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

100100100100100100

111111111111111111

把所有只含1和0的数枚举出来取余就行，然后用G++交才能过。。。

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        #include 
         
          #define INF 0x3f3f3f3f#define MAXN 1010using namespace std;void bfs(int n){ queue
          
            q; q.push(1); while(!q.empty()) { long long tmp=q.front(); q.pop(); if(tmp%n==0) { cout<
           
            <
            
             >n&&n) { bfs(n); } return 0;}

转载地址：http://bicvb.baihongyu.com/

你可能感兴趣的文章