代码

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=100+7,MAXA=25000;
int a[MAXN],vis[MAXA+7],n,m,T;
int main(){
	scanf("%d",&T);
	while(T--){
		m=0; memset(vis,0,sizeof(vis));
		scanf("%d",&n);
		for(int i=1;i<=n;++i) scanf("%d",&a[i]);
		sort(a+1,a+1+n);
		vis[0]=1;
		for(int i=1;i<=n;++i){
			if(vis[a[i]]) continue;
			++m;
			for(int j=0;j<=MAXA-a[i];++j){
				if(vis[j]){
					vis[j+a[i]]=1;
				}
			}
		}
		printf("%d\n",m);
	}
	return 0;
}

评测结果