[kuangbin带你飞]专题一 简单搜索E - Find The Multiple(POJ 1426)

E - Find The Multiple
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status Practice POJ
1426

Appoint description:
System Crawler (2015-11-08)

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的倍数且这个倍数只含1和0。

最高位肯定是1

方法一：直接枚举后面的位数1或者0。但是会超时我这里用的打表

打表