编程介的小学生
2017-09-04 07:58Find The Multiple
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 (0) 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
- 点赞
- 回答
- 收藏
- 复制链接分享
2条回答
为你推荐
- Find the nondecreasing subsequences
- each
- 3个回答
- Let the Balloon Rise
- lines
- it
- string
- color
- each
- 1个回答
- The shortest path
- lines
- path
- each
- 1个回答
- Find Its Place
- c
- numbers
- equals
- testing
- each
- 2个回答
- Find a way
- lines
- each
- it
- 地图
- 1个回答
换一换