# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166666 | abil | Bootfall (IZhO17_bootfall) | C++14 | 2 ms | 252 KiB |
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 fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);
int a[N];
main()
{
set<int > s;
int n;
cin >> n;
for(int i = 1;i <= n; i++){
scanf("%d", &a[i]);
s.insert(a[i]);
}
bool f = false;
for(int mask = 1;mask < (1 << n); mask++){
int sum = 0, sum1 = 0;
for(int i = 0;i < n; i++){
if(mask & i){
sum += a[i + 1];
}
else{
sum1 += a[i + 1];
}
}
if(sum == sum1){
f = true;
break;
}
}
if(!f){
cout << 0;
return 0;
}
cout << s.size() << endl;
for(auto to : s){
cout << to << " ";
}
}
Compilation message (stderr)
# | 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... |