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

建议使用的浏览器:

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

2283:Different Digits

题目描述
Given a positive integer n, your task is to find a positive integer m, which is a multiple of n, and that m contains the least number of different digits when represented in decimal. For example, number 1334 contains three different digits 1, 3 and 4.
输入解释
The input consists of no more than 50 test cases. Each test case has only one line, which contains a positive integer n ( 1<=n < 65536). There are no blank lines between cases. A line with a single `0' terminates the input.
输出解释
For each test case, you should output one line, which contains m. If there are several possible results, you should output the smallest one. Do not output blank lines between cases.
输入样例
7 
15 
16 
101 
0
输出样例
7
555
16
1111

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

题目来源 Shanghai 2004

源链接: POJ-2283

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

共提交 0

通过率 --%
时间上限 内存上限
4000 65536