HDU 1248 寒冰王座完全背包

最新推荐文章于 2024-10-05 23:29:09 发布

_NMfloat_

最新推荐文章于 2024-10-05 23:29:09 发布

阅读量328

点赞数

文章标签： c语言

本文链接：https://blog.csdn.net/NMfloat/article/details/50343939

版权

思路：完全背包，QAQ。

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

/*********************************************
    Problem : HDU 1248
    Author  : NMfloat
    InkTime (c) NM . All Rights Reserved .
********************************************/

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x)   memset(a,x,sizeof(a))
#define eps 1e-8

using namespace std;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5+5;
const int MAXE = 2e5+5;

typedef long long LL;
typedef unsigned long long ULL;

int T,n,m,k;

int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};

int dp[10005];
int b[] = {0,150,200,350};

void input() {
    scanf("%d",&n);
}

void solve() {
    cls(dp,0);
    dp[0] = 1;
    rep(i,1,3) {
        rep(j,b[i],10000) {
            if(dp[j-b[i]]) {
                dp[j] = 1;
            }
        }
    }
    int pos = 0;
    rep(i,1,n) {
        if(dp[i]) pos = i;
    }
    printf("%d\n",n-pos);
}

int main(void) {
    //freopen("a.in","r",stdin);
    scanf("%d",&T); while(T--) {
    //while(~scanf("%d %d",&n,&m)) {
    //while(scanf("%d",&n),n) {
        input();
        solve();
    }
    return 0;
}