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();
vector<int> tab(n,0);
tab[0] = w[0];
for(int i = 1; i < n; i++){
tab[i] = w[i]+tab[i-1];
}
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
int c = tab[j];
int d = tab[i-1];
if(i-1 < 0) d = 0;
int a = c-d;
//cout << a << endl;
if(a <= u && a>=l){
//cout << a << endl;
vector<int> v(0);
for(int k = i; k <= j; k++){
v.push_back(k);
}
return v;
}
}
}
vector<int> v(0);
return v;
}
/*int main(){
int a, b, c;
cin >> a >> b >> c;
vector<int> v(0);
for(int i = 0; i < a; i++){
int d;
cin >> d;
v.push_back(d);
}
v = find_subset(b,c,v);
cout << v.size() << endl;
for(int i = 0; i < v.size(); i++){
cout << v[i] << ' ';
}
cout << endl;
}*/
# | 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... |