//4470320 2011-08-22 16:10:25 Accepted 1248 156MS 360K 536 B C 刷媛姐刷过的题
#include <stdio.h>
#define T 101
#define N 10001
int a[4][N];
int max(int x, int y)
{
return x > y ? x : y;
}
int main()
{
int t, n, i, j, k, cnt;
int w[] = {0, 150, 200, 350};
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
for(i=0; i<=n; i++)
a[0][i] = 0;
for(i=1; i<=3; i++)
for(j=0; j<=n; j++)
{
a[i][j] = a[i-1][j];
for(k = 1; k * w[i] <= j; k++)
a[i][j] = max(a[i][j], a[i-1][j - k * w[i] ] + k * w[i]);
}
fprintf(stdout, "%d\n", n - a[3][n]);
}
return 0;
}
第一个完全背包,嘿嘿,没有优化。