Poj1426 DFS模板题

Find The Multiple

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 51502		Accepted: 21541		Special Judge

题目链接：http://poj.org/problem?id=1426

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，求只有0和1的数并且还是n的倍数的数是多少

思路：一开始想复杂了，以为要弄成二进制去做，后来直接暴力搜了一波竟然直接a了

 1 #include <iostream>
 2 
 3 
 4 using namespace std;
 5 
 6 typedef unsigned long long ULL;
 7 
 8 int n;
 9 bool flag = false;
10 
11 void DFS(int step, ULL t) {
12     if(step > 19 || flag)
13     return;
14     if (t % n == 0) {
15         cout << t << endl;
16         flag = true;
17         return;
18     }
19     DFS(step + 1, 10 * t);
20     DFS(step + 1, 10 * t + 1);
21 }
22 
23 int main() {
24     while (cin >> n) {    
25         if (!n)    return 0;
26         flag = false;
27         DFS(1, 1);
28     }
29     return 0;
30 }

View Code

 

转载于:https://www.cnblogs.com/DreamInPal/p/11406485.html