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>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n=w.size();
int bb=0;
if(w[0]*n<l||w[0]>u)
bb=1;
int rr=ceil((l*1.0)/(w[0]*1.0));
vector<int>g;
if(rr>u&&rr<l)
bb=1;
if(!bb)
for(int i=1;i<rr+1;i++)
g.push_back(i);
return g;
}
//15 25
//4 10 10 10 11
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |