当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1426:Find The Multiple

Special Judge 特殊评判
题目描述
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.
输入解释
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.
输出解释
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.
输入样例
2
6
19
0
输出样例
10
100100100100100100
111111111111111111

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 Dhaka 2002

源链接: POJ-1426

最后修改于 2020-10-29T06:03:57+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 10000