# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089864 | Frostidian | Detecting Molecules (IOI16_molecules) | C++14 | 0 ms | 348 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;
vector < int > find_subset ( int l, int r, vector < int > isi ){
int sa = 0;
vector < int > ans;
for ( int i = 0; i < isi.size(); i++ ){
sa += isi[i];
ans.push_back(isi[i - 1]);
if ( sa >= l && sa <= r ){
return ans;
}
}
return vector < int > (0);
}
/*
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;
}
*/
Compilation message (stderr)
# | 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... |