# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
942571 | 2024-03-10T22:13:58 Z | attky | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> w) { sort(w.begin(), w.end()); vector<int> tab; for(int loop = 1; loop <= n; ++loop) { if(l <= w[0]*loop && w[0]*loop <= u) { for(int looping = 0; looping < loop; ++looping) { tab.push_back(w[0]); } return tab; } } return tab; }