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;
int main()
{
int T;
cin >> T;
for (int i = 0; i < T; i++)
{
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
int out[N] = {0};
for (int deb = 0; deb < N; deb++)
{
bitset<2048> S;
S[0] = true;
int somme = 0;
for (int fin = deb; fin < N; fin++)
{
somme += A[fin];
S = S | (S << A[fin]);
if (somme % 2 == 1 || !S[somme / 2])
out[fin - deb] = 1;
}
}
int nb = 0;
for (int i = 0; i < N; i++)
if (out[i] == 0)
nb++;
cout << nb;
for (int i = 0; i < N; i++)
if (out[i] == 0)
cout << " " << i + 1;
cout << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |