HDU 1248 寒冰王座

http://acm.hdu.edu.cn/showproblem.php?pid=1248

完全背包.... 

#include <iostream>
#define maxn 10005
using namespace std;
int ans[maxn],v[3];
int main()
{
    int n, t, i, j;
    v[0] = 150;
    v[1] = 200;
    v[2] = 350;
    cin >> t;
    while(t--)
    {
        cin >> n;
        for(i = 0; i <= n; i++) ans[i] = 0;
        for(i = 0; i < 3; i++)
        for(j = 0; j <=n; j++)
        {
            if(j >= v[i] && ans[j-v[i]]+v[i] > ans[j])
             ans[j] = ans[j-v[i]]+v[i];
        }
        cout << n-ans[n] << endl;
    }
    return 0;
}