poj 1837 Balance dp
0-1背包
真是没想到..
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include <stdio.h>
int dp[25][15005];
int main()
{
int C,G,i,j,k,c[25],g[25];
scanf("%d%d",&C,&G);
for (i=0;i<C;i++)scanf("%d",&c[i]);
for (i=1;i<=G;i++)scanf("%d",&g[i]);
dp[0][7500]=1;
for (i=1;i<=G;i++)
{
for (j=0;j<=15000;j++)
{
for (k=0;k<C;k++)
{
dp[i][j+c[k]*g[i]]+=dp[i-1][j];
}
}
}
printf("%d\n",dp[G][7500]);
return 0;
}