poj 1426 Find The Multiple

http://poj.org/problem?id=1426

Find The Multiple

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit Status

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

26190

Sample Output

10100100100100100100111111111111111111

</pre><pre name="code" class="cpp">

</pre><pre name="code" class="cpp">#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <cmath>#include <cstdlib>#include <limits>#include <queue>#include <stack>using namespace std;#define N 11000#define INF 0xfffffff#define PI acos (-1.0)#define EPS 1e-8int n, flag;void DFS (unsigned long long t, int n, int k);int main (){    while (cin >> n, n)    {        flag = 0;        DFS (1, n, 0);    }    return 0;}void DFS (unsigned long long t, int n, int k){    if (flag) return;    if (t % n == 0)    {        printf ("%I64u\n", t);        flag = 1;        return;    }    if (k == 19) return;    DFS (t*10, n, k+1);    DFS (t*10+1, n, k+1);}