钱币兑换问题
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11382 Accepted Submission(s): 6917
Problem Description
在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。
Input
每行只有一个正整数N,N小于32768。
Output
对应每个输入,输出兑换方法数。
Sample Input
2934
12553
Sample Output
718831
13137761
Author
SmallBeer(CML)
Source
杭电ACM集训队训练赛(VII)
Recommend
lcy | We have carefully selected several similar problems for you: 1171 2159 1114 2191 2602
典型背包不多分析了
#include<bits/stdc++.h>
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const int MAX = 32768+5;
ll dp[MAX];
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];
}
}
cout<<dp[n]<<endl;
}
return 0;
}