POJ1248 寒冰王座（完全背包）

http://acm.hdu.edu.cn/showproblem.php?pid=1248
Here’s the original question .As the title say this a complete bag problem so I simply use a template which ac it onlt once.
I put this to remind me to believe my self.

#include<bits/stdc++.h>
using namespace std;
int c[4];
int f[100000];
int main()
{
    ios::sync_with_stdio(false);
    c[0]=150;
    c[1]=200;
    c[2]=350;
    memset(f,0,sizeof(f));
    int ca=0;
    cin>>ca;
    int n;
    while(ca--)
    {

        cin>>n;
        for(int i=0;i<3;i++)
        {
            for(int v=c[i];v<=n;v++)
            {
                f[v]=max(f[v],f[v-c[i]]+c[i]);
            }
        }
        cout<<n-f[n]<<endl;
    }


    return 0;
}