# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233570 | 2020-05-21T01:54:50 Z | jam_xd_ | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KB |
#include "molecules.h" #include "bits/stdc++.h" using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { vector<int>resp; vector<int> nada; int sum =0 ; for(int i=0;i<w.lenght();i++){ sum = sum + w[i]; resp.push_back(i); if(sum >= min(u,l) and sum <= max(u,l)){ return resp; break; } if(sum > max(u,l)){ return nada; break; } } } //:v ??