代码

#include<cstdio>
#include<algorithm>
#include<cstring>
#define Rint register int
using namespace std;
const int N = 103, M = 25003;
int t, n, ans, a[N];
bool f[M];
int main(){
	scanf("%d", &t);
	while(t --){
		memset(f, 0, sizeof f); ans = 0;
		scanf("%d", &n);
		for(Rint i = 1;i <= n;i ++)
			scanf("%d", a + i);
		sort(a + 1, a + n + 1);
		f[0] = 1;
		for(Rint i = 1;i <= n;i ++)
			if(!f[a[i]]){
				++ ans;
				for(Rint j = a[i];j <= 25000;j ++)
					f[j] |= f[j - a[i]];
			}
		printf("%d\n", ans);
	}
}

评测结果