# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672650 | mseebacher | 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;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> erg;
ll sum = 0;
for(int i = 0;i<n;i++){
if(sum >= l && sum <= u){
return erg;
}
sum += w[i];
erg.push_back(i);
}
return erg;
}