当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
2929：Bigger is Better
题目描述
Bob has n matches. He wants to compose numbers using the following scheme (that is, digit 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 needs 6, 2, 5, 5, 4, 5, 6, 3, 7, 6 matches):
Write a program to make a non-negative integer which is a multiple of m. The integer should be as big as possible.
Write a program to make a non-negative integer which is a multiple of m. The integer should be as big as possible.
输入解释
The input consists of several test cases. Each case is described by two positive integers n (n ≤ 100) and m (m ≤ 3000), as described above. The last test case is followed by a single zero, which should not be processed.
输出解释
For each test case, print the case number and the biggest number that can be made. If there is no solution, output -1.Note that Bob don't have to use all his matches.
输入样例
6 3 5 6 0
输出样例
Case 1: 111 Case 2: -1
来自杭电HDUOJ的附加信息
| Recommend | lcy |
最后修改于 2020-10-25T22:58:19+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 10000/5000MS(Java/Others) | 65536/32768K(Java/Others) |
登陆或注册以提交代码