1284 钱币兑换问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12917 Accepted Submission(s): 7834
Problem Description
在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。
Input
每行只有一个正整数N,N小于32768。
Output
对应每个输入,输出兑换方法数。
Sample Input
2934
12553
Sample Output
718831
13137761
动态规划版
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[32770];
// dp[i][j] 前i种硬币能把货币j换成硬币的种类数
// dp[i][j] = dp[i][j-coin[i]]+dp[i-1][j];
// 在优化一下
int main() {
int n;
while (cin >> n) {
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for (int i = 1; i <= 3; i++) {
for (int j = i; j <= n; j++) dp[j] = dp[j-i] + dp[j];
}
cout << dp[n] << "\n";
}
return 0;
}
母函数版
有待加强
#include <stdio.h>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int num[32770], temp[32770];
int main() {
int n;
for (int i = 0; i <= 32770; i++) {
num[i] = 1;
temp[i] = 0;
}
for (int i = 2; i <= 3; i++) {
for (int j = 0; j <= 32770; j++) {
for (int k = 0; k + j < 32770; k+=i) temp[k+j] = temp[k+j] + num[j];
}
for (int k = 0; k <= 32770; k++) {
num[k] = temp[k];
temp[k] = 0;
}
}
while (cin >> n) {
cout << num[n] << "\n";
}
}