# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588877 | mahra_IOI | 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 "molecyles.h"
#include <bits/bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
for(int take = 1 ; take <= n;take++){
if(take * w[0] >= l && take * w[0] <= u){
vector< int > ans;
for(int j = 0 ;j < take;j++)
ans.push_back(j);
return ans;
}
}
return vector<int>(0);
}