# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
942574 | attky | 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>
using namespace std;
vector<long long int> find_subset(int l, int u, vector<long long int> w) {
sort(w.begin(), w.end());
vector<long long int> tab;
for(long long int loop = 1; loop <= w.size(); ++loop) {
if(l <= w[0]*loop && w[0]*loop <= u) {
for(long long int looping = 0; looping < loop; ++looping) {
tab.push_back(w[0]);
}
return tab;
}
}
return tab;
}