HDU 1248 寒冰王座

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
int dp[10010],cost[3]={150,200,350};
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
memset(dp,0,sizeof(dp));
for(int i  = 0 ; i < 3 ; i++)
{
for(int v = cost[i] ; v <= n ; v++)
dp[v] = max(dp[v],dp[v-cost[i]]+cost[i]);
}
int ans = n - dp
;
printf("%d\n",ans);
}
return 0;
}