# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1218526 | islam_2010 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 0 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
int weight = w[0]
for (int i = 1; i <= n; i++) {
int sum = i * weight;
if (sum >= l && sum <= u) {
vector<int> V;
for (int i = 0; i < i; i++) {
V.push_back(i);
}
return V;
}
}
return {};
}