This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define N 100005
#define MOD 1000000007
#define endl '\n'
#define all(x) x.begin(), x.end()
typedef long long int ll;
const ll inf = 1e17;
void solve()
{
int n; cin >> n;
vector<int> arr(n + 1);
for(int i = 1; i <= n; ++i) cin >> arr[i];
vector<int> ks;
for (int k = 1; k <= n; ++k)
{
bool ok = true;
for (int i = 1; i <= n - k + 1; ++i)
{
int sum = 0;
for(int j = i; j < i + k; ++j)
sum += arr[j];
if(!(sum & 1))
{
vector<bool> part(sum / 2 + 1);
for (int j = i; j < i + k; ++j)
{
for(int l = sum / 2; l >= 0; --l)
{
if(part[l - arr[j]] == 1 or l == arr[j]) part[l] = true;
}
}
ok &= part[sum / 2];
}
ok &= (sum % 2 == 0);
}
if(ok) ks.pb(k);
}
cout << ks.size() << " ";
for(auto i : ks) cout << i << " ";
cout << endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t; cin >> t;
while(t--)
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |