这是一个使用动态规划（DP）解决的问题，目标是用n根火柴组合成一个十进制数，该数是m的倍数。文章通过定义f[i][j]表示使用i根火柴且对m取模为j时能组成的最大数，通过状态转移找到最大可能的组合。最后输出符合条件的最大数。
Problem Description
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.
Input
最低0.47元/天 解锁文章
扫一扫
4498
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
