| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1186960 | GoBananas69 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB | 
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
    if (w.empty())
        return {};
    int n = w.size();
    int val = w[0]; 
    int k = (l + val - 1) / val;
    if (k > n || k * val > u)
        return {};
    vector<int> res;
    for (int i = 1; i <= k; ++i) {
        res.push_back(i);
    }
    return res;
}
// signed main() {
//     cin.tie(0)->sync_with_stdio(0);
//     vector<int> res = find_subset(31, 35, {5, 5, 5, 5, 5, 5, 5});
//     for (int i = 0; i < res.size(); ++i) {
//         cout << res[i] << '\n';
//     }
// }
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
