# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305672 | 2020-09-23T19:01:57 Z | amunduzbaev | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include "molecules.h" #include <bits/stdc++.h> #include "grader.cpp" using namespace std; vector<int> find_subset(int l, int u, vector<int> a) { vector<int>ans; int sum=0,i=0; while(sum+a[i]<=u){ ans.push_back(i); sum+=a[i]; i++; } if(sum<l) ans.clear(); return ans; }