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) {
long long mask = 1;
for(; mask < (1LL << (int)w.size()) ; mask++) {
long long val=0;
for(int j = 0 ; j < 64 ; j++) {
if(mask & (1LL<<j)) {
val += w[j];
}
}
if(val >= l && val <= u) {
vector<int>ans;
for(int j = 0 ; j < 64 ; j++) {
if(mask & (1LL<<j)) {
ans.push_back(j);
}
}
return ans;
}
}
return {};
}
# | 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... |