# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305677 | 2020-09-23T19:14:59 Z | amunduzbaev | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#include "molecules.h" #include <bits/stdc++.h> #include "grader.cpp" using namespace std; vector<int> find_subset(int l, int u, vector<int> a) { vector<int>ans; int n=0; int f=a[0]; while((n+1)*f<=u){ ans.push_back(n); n++; } if(n*f<l) ans.clear(); return ans; }