51nod 1101 换零钱 完全背包的变型 动态规划

for(int i = 0;i < 13; i++){
for(int j = a[i];j <= n; j++){
dp[j] = (dp[j] + dp[j-a[i]])%mod;
}
}

#include <bits\stdc++.h>
using namespace std;

const int mod = 1e9+7;
int a[13] = {1,2,5,10,20,50,100,200,500,1000,2000,5000,10000};
int dp[100010];
int main(){
int n;
cin >> n;
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
<< endl;
return 0;
}