| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 239182 | lakshith_ | 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 <bits/stdc++.h>
using namespace std;
a
int find_subset(int l, int u, int[] w, int n, int[] result){
int m = 0;
int lo,hi;
lo = ceil((double)l/(double)w[0]);
hi = floor((double)u/(doublew[0]));
if(n<lo||(lo>=hi))return 0;
for(int i=0;i<lo;i++)
result[m++] = w[0];
return m;
}
// int main(){
// io_setup();
//
// }