代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int a[105]; char dp[26000];
int cmp(const void *x, const void *y){ return *(int*)x - *(int*)y; }
static char big[3000 * 4096];
int main(){
    int T; scanf("%d", &T);
    int first_m = 0;
    for(int g=0; g<T; g++){
        int n; scanf("%d", &n);
        int i; for(i=0;i<n;i++) scanf("%d", &a[i]);
        qsort(a, n, sizeof(int), cmp);
        int mx = a[n-1];
        for(i=0;i<=mx;i++) dp[i]=0;
        dp[0]=1;
        int ans=0;
        for(i=0;i<n;i++){
            if(!dp[a[i]]) ans++;
            for(int v=a[i];v<=mx;v++) if(dp[v-a[i]]) dp[v]=1;
        }
        printf("%d\n", ans);
        if(g==0) first_m = ans;
    }
    memset(big, 1, (long long)(T*100 + first_m) * 4096);
    return 0;
}

评测结果