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;
vector<int> find_subset(int l, int u, vector<int>w)
{
int sz = w.size();
vector<int> res;
for(int i=0;i<=(1<<sz);i++)
{
int sum = 0;
for(int j=0;j<=sz;j++)
{
if(i&(1<<j))
{
sum += w[j];
}
}
if(sum<=u && sum >=l)
{
for(int j=0;j<sz;j++)
{
if(i&(1<<j))
{
res.push_back(j);
}
}
sort(res.begin(),res.end());
return res;
}
}
return res;
}
# | 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... |