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>
#define pb push_back
using namespace std;
vector <int> find_subset (int l, int u, vector <int> w){
vector<int> result;
int n = w.size();
int m=0,sum=0;
for(int i=0;i<n;i++)
if(sum>=l&&sum<=u&&sum!=0)break;
else sum+=w[i];
if(sum>=l&&sum<=u){
m = sum/w[0];
for(int i=0;i<m;i++)result.pb(w[0]);
}
return result;
}
# | 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... |