HDU - 1284. 钱币兑换问题

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1284

考查完全背包，入门题。不太懂得这个转移方程可以看下这个：http://blog.csdn.net/u013480600/article/details/40477769

/* 转移方程: f[i][j] = sum( f[i-1][j], f[i][j - val[i]] ) ) */ #include <cstdio> #include <algorithm> #define MAX 33000 using namespace std; int dp[MAX]; int coin[4] = { 0, 1, 2, 3 }; int main() { dp[0] = 1; for( int i = 1; i <= 3; i++ ) { for( int j = 1; j < MAX; j++ ) { dp[j] = dp[j] + dp[j - coin[i]]; } } int n; while( scanf( "%d", &n ) != EOF ) { printf( "%d\n", dp[n] ); } return 0; }