# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019867 | vjudge1 | 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>
//#define int long long
using namespace std;
vector <int> find_subset(int l, int u, vector <int> w)
int sum = 0;
vector <int> id;
for (int i = 0; i < w.size(); i++) {
id.push_back(i);
sum+=w[i];
if (sum>=l and sum <= u) {
return id;
}
}
return {};
}
/*
signed main() {
int t;
cin >> t;
while(t--) {
//solve();
}
}
* */