N元钱换为零钱,有多少不同的换法?币值包括1 2 5分,1 2 5角,1 2 5 10 20 50 100元。
例如:5分钱换为零钱,有以下4种换法:
1、5个1分
2、1个2分3个1分
3、2个2分1个1分
4、1个5分
(由于结果可能会很大,输出Mod 10^9 + 7的结果)
Input
输入1个数N,N = 100表示1元钱。(1 <= N <= 100000)
Output
输出Mod 10^9 + 7的结果
Input示例
5
Output示例
4 方法一:#include <iostream> #include <vector> using namespace std; const int FACTOR = 1e9 + 7; const int COINS[13] = {1, 2, 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000}; struct Node { int firstVal; int num; Node(int v, int n) { firstVal = v; num = n; } }; int fun(int N) { vector<vector<Node> > dp(N+1); int pos = 0; dp[0].push_back(Node(0, 1)); for (int i = 1; i <= N; i++) { if ((pos+1 < 13) && COINS[pos+1] == i) { pos++; } for (int j = pos; j >= 0; j--) { int firstVal = COINS[j]; int num = 0; for (int k = dp[i-firstVal].size()-1; k >= 0; k--) { if (firstVal >= dp[i-firstVal][k].firstVal) { num += dp[i-firstVal][k].num; num %= FACTOR; } else { break; } } dp[i].push_back(Node(firstVal, num)); } } int result = 0; for (int i = 0; i < dp[N].size(); i++) { result += dp[N][i].num; result %= FACTOR; } return result; } int main() { int N; cin >> N; cout << fun(N) << endl; return 0; }
方法二:#include <iostream>> using namespace std; const int FACTOR = 1e9 + 7; const int COINS[13] = {1, 2, 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000}; int dp[100001]; int fun(int N) { dp[0] = 1; for( int i = 0; i < 13; ++i ) { for (int j = COINS[i]; j <= N; j++ ) { dp[j] = (dp[j] + dp[j-COINS[i]]) % FACTOR; } } return dp[N]; } int main() { int N; cin >> N; cout << fun(N) << endl; return 0; }