作者:
ღSupperღ
,
2022-06-23 17:25:04
,
所有人可见
,
阅读 2
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int N = 25010;
int f[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while(T -- )
{
int n;
cin >> n;
vector<int> a(n);
for(auto &t : a)
cin >> t;
sort(a.begin(), a.end());
memset(f,0,sizeof f);
f[0] = 1;
int res = 0;
for(int i = 0; i < n; i ++ )
{
if(!f[a[i]]) res++;
for(int j = a[i]; j <= a[n - 1]; j ++ )
f[j] += f[j - a[i]];
}
cout << res << "\n";
}
return 0;
}