# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019864 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 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;
int[] find_subset(int l, int u, int[] w){
int div=u/w[0];
int[] result;
if(div*w[0]>l&&div<=n){
for(int i=0; i<div; ++i){
result[i]=1;
}
}
return result;
}