HDU 1248 完全背包问题 寒冰王座

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 10001

int f
, value[3];
int main()
{
int i, j, V, ncases;

scanf("%d", &ncases);
while( ncases-- )
{
scanf("%d",&V);
value[0] = 150;
value[1] = 200;
value[2] = 350;

memset(f,0,sizeof(f));
for(i=0; i<3; i++)
for(j=value[i]; j<=V; j++)
{
if(f[j] < f[j-value[i]]+value[i])
f[j] = f[j-value[i]]+value[i];
}

printf("%d\n",V-f[V]);
}
return 0;
}