Find The Multiple

最新推荐文章于 2020-02-22 23:29:36 发布

原创最新推荐文章于 2020-02-22 23:29:36 发布 · 162 阅读

0 ·

CC 4.0 BY-SA版权

ACM 同时被 2 个专栏收录

73 篇文章

订阅专栏

DFS

14 篇文章

订阅专栏

本文介绍了一个编程问题，即寻找一个正整数n的非零倍数m，且m的十进制表示仅包含0和1。通过深度优先搜索（DFS）算法解决此问题，并提供了一段AC代码作为实现示例。

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

思路：DFS 刚开始没认真看题，后面发现只需要输出符合要求的就行

AC代码：

#include<iostream>
#include<cstdio>
using namespace std;
long long int n;
int flag=0;

void dfs(unsigned long long int a,int k){
    if(flag)return ;
   if(a%n==0){
   cout<<a<<endl;
     flag=1;
    return ;
    }
   if(k>=20)return ;
  dfs(a*10,k+1);
  dfs(a*10+1,k+1);
}

int main(){
 while(cin>>n&&n){
   flag=0;
   dfs(1,1);
 }
return 0;
}