| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 305677 | amunduzbaev | Detecting Molecules (IOI16_molecules) | C++14 | 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>
#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;
}
