51Nod 1101 换零钱

复制代码

//完全背包的变形
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int MOD = 1e9 + 7;
const int maxn = 100000 + 5;
int a[13] = { 1, 2, 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000 };
int dp[maxn];

int main(){
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    memset(dp, 0, sizeof(dp));
    dp[0] = 1;
    for (int i = 0; i < 13; i++){
        for (int j = a[i]; j <= n; j++){
            dp[j] = (dp[j] + dp[j - a[i]]) % MOD;
        }
    }
    cout << dp[n] << endl;

    system("pause");
    return 0;
}