POJ 1426 Find The Multiple 寻找倍数

点击打开链接

Find The Multiple

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

Source

Dhaka 2002

给出一个正整数n，找出一个非零倍数，使得这个倍数的十进制形式只由0和1组成。

只对余数的尾数进行填0或1操作，等效于对原数操作。

//388K	94MS
#include<stdio.h>
#include<string.h>
char s[107];
int flag;
void dfs(int r,int digit,int n)
{
    if(digit>100)return;
    if(!r)//如果余数为0，则找到
    {
        flag=true;
        s[digit]=0;
        return;
    }
    if(!flag)//在末尾填0
    {
        s[digit]='0';
        dfs((r*10)%n,digit+1,n);
    }
    if(!flag)//在末尾填1
    {
        s[digit]='1';
        dfs((r*10+1)%n,digit+1,n);
    }
}
int main()
{
    int n;
    while(scanf("%d",&n),n)
    {
        memset(s,0,sizeof(s));
        s[0]='1';
        flag=false;
        dfs(1,1,n);
        printf("%s\n",s);
    }
    return 0;
}