# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1041374 | arnavsrivastava0123 | Reversing a Sequence (IOI16_reverse) | 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>
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define ll long long
#define ld long double
#define mp make_pair
#define F first
#define S second
using namespace std;
int n;
auto reverse(ll a[]){
ll res[n];
for(int i = n - 1, j = 0; i >= 0;i--){
res[j++] = a[i];
}
return res;
}
void solve(){
cin >> n;
ll a[n];
for(int i = 0; i < n;i++){
cin >> a[i];
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}