题目链接:here
题目大意:
n 块钱 如何由 1-k 块钱组合起来的方法。。
分析:
完全背包。。但是注意高精度。。
代码:
java:
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
public class poj3181dp {
final static int maxn = 1005;
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while (cin.hasNext()){
int n, k;
n = cin.nextInt();
k = cin.nextInt();
BigInteger[] dp = new BigInteger[maxn];
Arrays.fill(dp, BigInteger.ZERO);
dp[0] = BigInteger.ONE;
for (int i=1; i<=k; i++)
for (int j=0; i+j<=n; j++)
dp[i+j] = dp[i+j].add(dp[j]);
System.out.println(dp[n]);
}
}
}
C++:
#include <cstdio>
#include <iostream>
using namespace std;
const int maxn = 1100;
__int64 a[maxn], b[maxn], inf;
int n, k;
int main()
{
int i, j;
inf = 1;
for (i=0; i<18; i++) inf *= 10;
scanf("%d %d", &n, &k);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
a[0] = 1;
for (i=1; i<=k; i++)
for (j=1; j<=n; j++)
{
if (j < i) continue;
b[j] = b[j] + b[j-i] + (a[j] + a[j-i]) / inf;
a[j] = (a[j] + a[j-i]) % inf;
}
if (b[n]) printf("%I64d", b[n]);
printf("%I64d\n", a[n]);
return 0;
}