Submission #1121919

#	Time	Username	Problem	Language	Result	Execution time	Memory
1121919		vjudge1	Calvinball championship (CEOI15_teams)	C++17	0 / 100	3 ms	336 KiB

teams

#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;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10