HDU - 1248 寒冰王座(完全背包做法和暴力优化做法)

 1 #include <iostream>
 2 using namespace std;
 3 
 4 const int maxn=11111;
 5 int dp[maxn];
 6 
 7 int main(){
 8     int t;
 9     cin>>t;
10     int value[4]={0,150,200,350};
11     while(t--){
12         int n;
13         cin>>n;
14         for(int i=1;i<=3;i++){
15             for(int j=value[i];j<=n;j++){
16                 dp[j]=max(dp[j],dp[j-value[i]]+value[i]);
17             }
18         }
19         cout<<n-dp[n]<<endl;
20     }
21     return 0;
22 }

 1 #include<stdio.h>
 2 int main(){
 3     int t,n;
 4     int list[6]={0,50,100,0,0,50};
 5     scanf("%d",&t);
 6     while(t--){
 7         scanf("%d",&n);
 8         if(n<300) printf("%d\n",n%50+list[n/50]);
 9         else printf("%d\n",n%50);
10     }
11     return 0;
12 }