이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
// sinagdir hell sayilmir kocurmedir
void computeSubsetSums(const vector<ll>& arr, vector<ll>& subsetSums) {
int n = arr.size();
for (int mask = 0; mask < (1 << n); ++mask) {
ll sum = 0;
for (int i = 0; i < n; ++i) {
if (mask & (1 << i)) {
sum += arr[i];
}
}
subsetSums.push_back(sum);
}
}
int main() {
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
cout<<4<<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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |