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>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 1000;
int n, a[N];
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin >> n;
int sum = 0;
bitset<N> ddp;
ddp[0] = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
ddp |= (ddp << a[i]);
}
if (sum%2 == 1 || !ddp[sum/2]) {
cout << "0\n";
return 0;
}
vector<int> v;
for (int i = 1; i <= sum; i++) {
bool ok = true;
for (int p = 0; p < n; p++) {
bitset<N> dp;
dp[0] = 1;
int ss = 0;
for (int j = 0; j < n; j++) {
if (p == j) continue;
dp |= (dp << a[j]);
ss += a[j];
}
if ((ss+i)%2 == 1) {
ok = false;
break;
}
if (!dp[(ss+i)/2]) {
ok = false;
break;
}
}
if (ok) v.push_back(i);
}
cout << v.size() << '\n';
for (int i : v) cout << i << ' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |