没参加笔试, 看到题目顺手做下, 差不多就多重背包问题, 统计数量的话直接dp不优化应该也差不多.

#include<bits/stdc++.h>
using namespace std;
int main(){
    vector<int> c(6);
    vector<int> v{1, 5, 10, 20, 50, 100};
    for (int i = 0; i < 6; i++) {
        cin >> c[i];
    }
    int n;
    cin >> n;
    vector<int> cur(n + 1, 0);
    vector<int> dp(n + 1, 0);
    dp[0] = 0;
    cur[0] = 1;
    for (int i = 0; i < 6; i++) {
        for (int j = n; j >= v[i]; j--) {
            for (int k = 1; k <= c[i] && j - k * v[i] >= 0; k++) {
                dp[j] += dp[j - k * v[i]] + k * cur[j - k * v[i]];
                cur[j] += cur[j - k * v[i]];
            }
        }
    }
    cout << dp[n] << endl;
}