Language: C++

#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

// modint

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

vector<ll> A;
 
int main(){
    ll N,B;
    cin >> N;
    rep(i,N){
        cin >> B ;
        A.pb(B);
    }
    ll T = N-1;
    while(T>=0){
        cout << A[T] << " ";
        T-=2;
    }
    T=0;
    if(N%2==1){
        T=1;
    }
    while(T<N-1){
        cout << A[T]  << " ";
        T+=2;
    }
    cout << endl;
}
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rRep(i,a,b) for(int i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

vector<ll> A;

int main(){
  ll N,B;
  cin >> N;
  rep(i,N){
    cin >> B ;
    A.pb(B);
  }
  ll T = N-1;
  while(T>=0){
    cout << A[T] << " ";
    T-=2;
  }
  T=0;
  if(N%2==1){
    T=1;
  }
  while(T<N-1){
    cout << A[T]  << " ";
    T+=2;
  }
  cout << endl;
}

Compiler output:
a.cc:176:9: warning: "rrep" redefined
  176 | #define rrep(i,n) for(int i=n-1;i>=0;i--)
      |         ^~~~
a.cc:36:9: note: this is the location of the previous definition
   36 | #define rrep(i,n) for(ll i=n-1;i>=0;i--)
      |         ^~~~
a.cc:177:9: warning: "rRep" redefined
  177 | #define rRep(i,a,b) for(int i=a;i>=b;i--)
      |         ^~~~
a.cc:37:9: note: this is the location of the previous definition
   37 | #define rRep(i,a,b) for(ll i=a;i>=b;i--)
      |         ^~~~
a.cc:183:5: error: redefinition of 'int ctoi(char)'
  183 | int ctoi(const char c){
      |     ^~~~
a.cc:43:5: note: 'int ctoi(char)' previously defined here
   43 | int ctoi(const char c){
      |     ^~~~
a.cc:187:4: error: redefinition of 'll gcd(ll, ll)'
  187 | ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
      |    ^~~
a.cc:47:4: note: 'll gcd(ll, ll)' previously defined here
   47 | ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
      |    ^~~
a.cc:188:4: error: redefinition of 'll lcm(ll, ll)'
  188 | ll lcm(ll a,ll b){return a*b/gcd(a,b);}
      |    ^~~
a.cc:48:4: note: 'll lcm(ll, ll)' previously defined here
   48 | ll lcm(ll a,ll b){return a*b/gcd(a,b);}
      |    ^~~
a.cc:189:14: error: redefinition of 'constexpr const ll MOD'
  189 | constexpr ll MOD=1000000007;
      |              ^~~
a.cc:49:14: note: 'constexpr const ll MOD' previously defined here
   49 | constexpr ll MOD=1000000007;
      |              ^~~
a.cc:190:14: error: redefinition of 'constexpr const ll INF'
  190 | constexpr ll INF=1000000011;
      |              ^~~
a.cc:50:14: note: 'constexpr const ll INF' previously defined here
   50 | constexpr ll INF=1000000011;
      |              ^~~
a.cc:191:14: error: redefinition of 'constexpr const ll MOD2'
  191 | constexpr ll MOD2=998244353;
      |              ^~~~
a.cc:51:14: note: 'constexpr const ll MOD2' previously defined here
   51 | constexpr ll MOD2=998244353;
      |              ^~~~
a.cc:192:14: error: redefinition of 'constexpr const ll LINF'
  192 | constexpr ll LINF = 1001002003004005006ll;
      |              ^~~~
a.cc:52:14: note: 'constexpr const ll LINF' previously defined here
   52 | constexpr ll LINF = 1001002003004005006ll;
      |              ^~~~
a.cc:193:14: error: redefinition of 'constexpr const ld EPS'
  193 | constexpr ld EPS=10e-8;
      |              ^~~
a.cc:53:14: note: 'constexpr const ld EPS' previously defined here
   53 | constexpr ld EPS=10e-8;
      |              ^~~
a.cc:196:31: error: redefinition of 'template<class T> std::istream& operator>>(std::istream&, std::vector<_Tp>&)'
  196 | template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
      |                               ^~~~~~~~
a.cc:56:31: note: 'template<class T> std::istream& operator>>(std::istream&, std::vector<_Tp>&)' previously declared here
   56 | template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
      |                               ^~~~~~~~
a.cc:197:42: error: redefinition of 'template<class T, class U> std::istream& operator>>(std::istream&, std::pair<_T1, _T2>&)'
  197 | template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
      |                                          ^~~~~~~~
a.cc:57:42: note: 'template<class T, class U> std::istream& operator>>(std::istream&, std::pair<_T1, _T2>&)' previously declared here
   57 | template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
      |                                          ^~~~~~~~
a.cc:198:42: error: redefinition of 'template<class T, class U> std::ostream& operator>>(std::ostream&, const std::pair<_T1, _T2>&)'
  198 | template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
      |                                          ^~~~~~~~
a.cc:58:42: note: 'template<class T, class U> std::ostream& operator>>(std::ostream&, const std::pair<_T1, _T2>&)' previously declared here
   58 | template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
      |                                          ^~~~~~~~
a.cc:199:28: error: redefinition of 'template<class T> std::ostream& operator<<(std::ostream&, std::vector<_Tp>&)'
  199 | template<class T> ostream& operator<<(ostream& os, vector<T>& v){
      |                            ^~~~~~~~
a.cc:59:28: note: 'template<class T> std::ostream& operator<<(std::ostream&, std::vector<_Tp>&)' previously declared here
   59 | template<class T> ostream& operator<<(ostream& os, vector<T>& v){
      |                            ^~~~~~~~
a.cc:207:12: error: redefinition of 'std::vector<long long int> A'
  207 | vector<ll> A;
      |            ^
a.cc:121:12: note: 'std::vector<long long int> A' previously declared here
  121 | vector<ll> A;
      |            ^
a.cc:209:5: error: redefinition of 'int main()'
  209 | int main(){
      |     ^~~~
a.cc:123:5: note: 'int main()' previously defined here
  123 | int main(){
      |     ^~~~