题目:http://acm.split.hdu.edu.cn/showproblem.php?pid=1248
思路:完全背包求最大价值
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 50005;
int v[N]={0,150,200,350},dp[N];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
memset(dp,0,sizeof(dp));
for(int i = 1;i <= 3;i++)
for(int j = v[i];j <= n;j++)
dp[j] = max(dp[j],dp[j-v[i]]+v[i]);
printf("%d\n",n-dp[n]);
}
return 0;
}