Find The Multiple POJ1426(搜索水题)

传送门

Find The Multiple

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

2
6
19
0

Sample Output

10
100100100100100100
111111111111111111

题意：给定一个正整数n，找出一个n的非零倍数m，但只有0，1组成的数字

思路：dfs遍历所有的数字，从1开始，遍历为10或者11，就是 * 2   或者   *2 + 1   

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
ll n , flag;

void dfs(ll m , ll step){
  if(flag == 1 || step > 18)
    return ;
  if(m % n == 0){
    cout<< m << endl;
    flag = 1;
  }
  dfs(m * 10 , step + 1);
  dfs(m * 10 + 1 , step + 1);
}

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