Luogu 2737 [USACO4.1]麦香牛块Beef McNuggets

#include <cstdio>
using namespace std;

const int N = 15;
const int M = 65030;

int n, a[N];
bool f[M];

inline void read(int &X) {
    X = 0; char ch = 0; int op = 1;
    for(; ch > ‘9‘|| ch < ‘0‘; ch = getchar())
        if(ch == ‘-‘) op = -1;
    for(; ch >= ‘0‘ && ch <= ‘9‘; ch = getchar())
        X = (X << 3) + (X << 1) + ch - 48;
    X *= op;
}

int main() {
    read(n);
    for(int i = 1; i <= n; i++) read(a[i]);
    
    f[0] = 1;
    for(int i = 0; i < M; i++)
        for(int j = 1; j <= n; j++)
            if(i - a[j] >= 0) f[i] |= f[i - a[j]];
    
    int ans = 0;
    for(int i = 65029; i >= 0; i--)
        if(!f[i]) {
            ans = i;
            break;
        }
    if(ans > 65024) ans = 0;
    
    printf("%d\n", ans);
    return 0;
}