UVALive - 3782 Bigger is Better DP

题目大意:给出n根火柴，问能否用这n根火柴拼出一个能被m整除的数，不要求每根火柴都用到

解题思路：用一个二维dp数组，dp[i][j]表示用不大于i根的火柴，拼出一个%m == j的数的位数

设置两个新的量，newi和newj，newi = i + num[k], newj = (10 * j+ k) %m，num[k]表示需要用多少根火柴才能拼成k

如果i + num[k] <= n && dp[i][j] + 1 > dp[newi][newj]，那么dp[newi][newj] = dp[i][j] + 1

还有一个特殊的数，0能被任何数整除

#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 110
#define maxm 3010
int dp[maxn][maxm], path[maxn][maxm], n, m, MAX, mark = 1;	
int num[10] = {6,2,5,5,4,5,6,3,7,6};

void init() {
	scanf("%d",&m);
	memset(dp,-1,sizeof(dp));
	dp[0][0] = 0, MAX = 0;
}

void solve() {
	for(int i = 0; i < n; i++)
		for(int j = 0; j < m; j++)
			if(dp[i][j] >= 0)
				for(int k = 9; k >= 0; k--) 
					if(num[k] + i <= n) {
						int newi = i + num[k], newj = (j * 10 + k) % m;
						if(dp[i][j] + 1 > dp[newi][newj]) {
							dp[newi][newj] = dp[i][j] + 1;
							if(dp[newi][newj] > MAX && newj == 0) 
								MAX = dp[newi][newj];
						}	
					}
}

void find_path() {

	memset(path,-1,sizeof(path));
	for(int i = n; i >= 0; i--)
		for(int j = 0; j < m; j++)
			if(dp[i][j] >= 0) {
				if(dp[i][j] == MAX && j == 0) {
					path[i][j] = 10;
					continue;
				}
				for(int k = 9; k >= 0; k--) 
					if(i + num[k] <= n) {
						int newi = i + num[k], newj = (j * 10 + k) % m;
						if(dp[newi][newj] == dp[i][j] + 1 && path[newi][newj] >= 0) {
							path[i][j] = k;
							break;
						}
					}
			}
}

void print() {

	printf("Case %d: ", mark++);
	int i, j, k, l;

	if(MAX > 0) {
		i = 0, j = 0;
		while(path[i][j] != 10) {
			k = i + num[path[i][j]];
			l = (j * 10 + path[i][j]) % m;
			printf("%d",path[i][j]);
			i = k, j = l;	
		}
		printf("\n");	
	}
	else if(n >= num[0])
		printf("0\n");
	else
		printf("-1\n");
}

int main() {
	while(scanf("%d", &n) == 1 && n) {
		init();
		solve();
		find_path();
		print();
	}
	return 0;
}