# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425325 | dreezy | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 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>
#include "molecules.h"
using namespace std;
#define pb push_back
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> ans;
int cursum = 0;
for(int i =0; i<n; i++){
cursum+= w[i];
ans.pb(w[i]);
if( cursum >= u || cursum <=l)
return ans;
}
return vector<int>();
}
/***************/