# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233558 | 2020-05-21T01:29:48 Z | pere_gil | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include <iostream> #include "molecules.h" int find_subset(int l, int u, int[] w){ int tot=1<<w.size(); std::vector<int> pos; for(int i=0;i<tot;i++){ int sum=0; pos.clear(); for(int j=0;j<w.size();j++){ if((i&(1<<j)) % w[j]<=u){ sum+=w[j]; pos.push_back(w[j]); } if(sum<=u and sum>=l){ break; } } } return pos; }