제출 #1121919

#제출 시각아이디문제언어결과실행 시간메모리
1121919vjudge1Calvinball championship (CEOI15_teams)C++17
0 / 100
3 ms336 KiB
#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<<102<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...