E - Find The Multiple POJ - 1426

E - Find The Multiple

POJ - 1426

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

AC代码1：

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<string>
#include<cstdio>
#include<cstring>
#include<sstream>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>

using namespace std;
const int maxn = 20;
const int INF = 0x3f3f3f3f;
const int mod = 7;
typedef long long ll;
#define PI 3.1415927


int n, m;
vector<int> ans(105);
bool flag = false;
void dfs(int x, int k)
{
    if(flag || k >19) return;
    if(!x)
    {
        flag = true;
        for(int i = 0; i < ans.size(); ++i)
            printf("%d", ans[i]);
        printf("\n");
        return;
    }

    ans.push_back(0);
    dfs(x*10%n,k+1);
    ans.pop_back();

    ans.push_back(0);
    ans[ans.size()-1]++;
    dfs((x*10+1)%n,k+1);
    ans[ans.size()-1]--;
    ans.pop_back();
}
int main()
{
    while(~scanf("%d", &n)&&n)
    {
        flag = false;
        ans.clear();
        ans.push_back(1);
        dfs(1%n,1);
    }
    return 0;
}

AC代码2：

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<string>
#include<cstdio>
#include<cstring>
#include<sstream>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>

using namespace std;
const int maxn = 20;
const int INF = 0x3f3f3f3f;
const int mod = 7;
typedef long long ll;
#define PI 3.1415927


int n, m;
vector<int> ans(105);
bool flag = false;
void dfs(long long x, int k)
{
    if(flag || k >19) return;
    if(!(x%n))
    {
        flag = true;
        printf("%lld\n",x);
        return;
    }

    dfs(x*10, k+1);
    dfs(x*10+1, k+1);
}
int main()
{
    while(~scanf("%d", &n)&& n)
    {
        flag = false;
        dfs(1,1);
    }
    return 0;
}