# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233608 | pere_gil | Detecting Molecules (IOI16_molecules) | C++14 | 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 <iostream>
#include "molecules.h"
#include <vector>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w){
long long n=w.size();
long long tot=1<<n;
vector<long long> res;
for(int i=0;i<tot;i++){
long long sum=0;
res.clear();
for(int j=0;j<n;j++){
if(i&(1<<j)){
sum+=w[j];
res.push_back(j);
}
}
if(sum>=l and sum<=u){ break; }
}
return res;
}