# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239182 | 2020-06-14T17:29:36 Z | lakshith_ | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KB |
#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(); // // }