代码

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int T, n, a[233];
bool ex[50005];
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
            scanf("%d", a + i);
        memset(ex, 0, sizeof ex);
        ex[0] = 1;
        sort(a + 1, a + n + 1);
        int mx = 0, ans = 0;
        for (int i = 1; i <= n; i++)
            mx = max(mx, a[i]);
        for (int i = 1; i <= n; i++) {
            if (ex[a[i]]) continue;
            for (int j = a[i]; j <= mx; j++)
                ex[j] |= ex[j - a[i]];
            ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}

评测结果