51Nod - 1101 背包

题意：

输入1个数N，N = 100表示1元钱。(1 <= N <= 100000)

输出Mod 10^9 + 7的结果

5

4

思路：

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 10;
const int MOD = 1e9 + 7;

int v[20] = {0, 1, 2, 5, 10, 20, 50, 100, 200, 500, 1000, 2000, 5000, 10000};
ll dp[MAXN];

int main() {
int n;
scanf("%d", &n);
dp[0] = 1;
for (int i = 1; i <= 13; i++) {
for (int j = v[i]; j <= n; j++) {
dp[j] = (dp[j] + dp[j - v[i]]) % MOD;
}
}
printf("%I64d\n", dp
);
return 0;
}