http://acm.hdu.edu.cn/showproblem.php?pid=2191
#include<stdio.h>
#include<string.h>
#define max(x,y) (x>y?x:y)
int main()
{
int i,j,C,n,m,p,h,c,a[4010],b[4010],dp[4010],k;
scanf("%d",&C);
while(C--)
{
k=0;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
{
scanf("%d%d%d",&p,&h,&c);
while(c--)
{
a[k]=p;
b[k++]=h;
}
}
memset(dp,0,sizeof(dp));
for(i=0;i<k;i++)
for(j=n;j>=a[i];j--)
dp[j]=max(dp[j],dp[j-a[i]]+b[i]);
printf("%d\n",dp[n]);
}
return 0;
}
#include <iostream>
using namespace std;
const int N = 105;
const int MAXW = 4005;
int v[N], w[N], num[N];
int dp[MAXW];
int max(int x, int y)
{
if(x > y)
return x;
else
return y;
}
int main()
{
int t;
cin >>t;
while(t--)
{
int n , m;
cin >> n >> m;
for(int i = 0; i < m; i++)
cin >> w[i] >> v[i] >> num[i];
memset(dp, 0, sizeof(dp));
for(int i = 0; i < m; i++)
{
for(int j = 1; j <= num[i]; j++)
{
for(int k = n; k >= w[i]; k--)
{
dp[k] = max(dp[k], dp[k-w[i]] +v[i]);
}
}
}
cout << dp[n] << endl;
}
return 0;
}