题目
思路
思路1:
d(i,j)表示i根火柴,除以m得余数j的最大可以拼出来的数。
问题:拼数问题需要高精度算法,计算量大。
思路2:
d(i,j)表示i根火柴,除以m得余数j的可以拼出来的最大位数。
在计算位数时,顺便记录每一位的最大值。根据贪心,位数越大数字越大越好。
抖机灵题,看看就好
代码
// UVa12105 Bigger is Better
// Rujia Liu
// This solution is simpler than the one described in the book
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 100 + 5;
const int maxm = 3000 + 5;
// dp[i][j] is the maximal length of the integer whose remainder is j (with at most i matches)
// p[i][j] is the maximal digit for state (i,j)
int n, m, dp[maxn][maxm], p[maxn][maxm];
int needs[] = { 6, 2, 5, 5, 4, 5, 6, 3, 7, 6 };
int main(){
int kase = 0;
while(scanf("%d%d", &n, &m) == 2) {
printf("Case %d: ", ++kase);
for(int i = 0; i <= n; i++)
for(int j = 0; j < m; j++){
int& ans = dp[i][j];
ans = p[i][j] = -1;
if (j == 0) ans = 0;
for(int d = 9; d >= 0; d--)
if (i >= needs[d]){
int t = dp[i - needs[d]][(j * 10 + d) % m];
if (t >= 0 && t + 1 > ans){
ans = t + 1;
p[i][j] = d;
}
}
}
if (p[n][0] < 0) printf("-1");
else {
int i = n, j = 0;
for(int d = p[i][j]; d >= 0; d = p[i][j]){
printf("%d", d);
i -= needs[d];
j = (j * 10 + d) % m;
}
}
printf("\n");
}
return 0;
}