# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233813 | jam_xd_ | 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 "molecules.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int gg = w[0], funcionaaa = w.size(), sum = 0;
bool afirmo;
vector<int>covid;
vector<int>nada;
if(l == u and w[0]!= l or gg * funcionaa < max(l,u))return nada;
}
//:v ??