# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089855 | Frostidian | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 0 KiB |
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;
#define int long long
vector < int > find_subset ( int l, int r, vector < int > isi ){
int sa = 0;
vector < int > ans;
for ( int i = 1; i <= isi.size(); i++ ){
sa += isi[i - 1];
if ( sa >= l && sa <= r ){
for ( int j = 1; j <= i; j++ ){
ans.push_back(isi[j]);
}
}
}
return ans;
}
/*
signed main(){
vector < int > isi {2, 2, 2, 2, 2};
vector < int > ans = find_subset ( 4, 4, isi );
for ( auto x : ans ) cout << x << endl;
}
*/