POJ3181 动态规划 完全背包

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

long long dp[100 + 10][1000 + 10][2];
int main()
{
memset(dp, 0, sizeof(dp));
long long limit = 1;
for(int i = 0; i < 18; i++) limit *= 10;

int n, k;
scanf("%d%d", &n, &k);
for(int i = 0; i <= k; i++)
{
dp[i][0][1] = 1;
}
for(int i = 1; i <= k; i++)
{
for(int j = 1; j <= n; j++)
{
if(j >= i)
{
dp[i][j][0] = dp[i - 1][j][0] + dp[i][j - i][0];
dp[i][j][1] = dp[i - 1][j][1] + dp[i][j - i][1];
dp[i][j][0] += dp[i][j][1] / limit;
dp[i][j][1] %= limit;
}
else
{
dp[i][j][0] = dp[i - 1][j][0];
dp[i][j][1] = dp[i - 1][j][1];
}
}
}
if(dp[k]
[0] == 0) printf("%lld", dp[k]
[1]);
else printf("%lld%018lld\n", dp[k]
[0], dp[k]
[1]);
return 0;
}