test_cases = int(input())
total=[]
for test in range(test_cases):
elements=int(input())
sequence = list(map(int,input().split()))
for index,number in enumerate(sequence):
if len(sequence)==1:
total.append(sequence[0])
break
if len(sequence)%2!=0:
total.append(str(sequence[index])+" "+str(sequence[len(sequence)-index-1]))
if len(sequence)-index-1 == index:
str1=total[-1]
total[-1] = str1.split(" ")[0]
break
else:
total.append(str(sequence[index])+" "+str(sequence[len(sequence)-index-1]))
if (len(sequence)-index-1) - index ==1:
break
print(*total)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int arr[n];
for(int i=0; i<n; i++)
{
cin>>arr[i];
}
for(int i=0; i<n/2; i++)
{
cout<<arr[i]<<" "<<arr[n-i-1]<<" ";
}
if(n%2!=0)
{
cout<<arr[n/2];
}
cout<<endl;
}
}
1281C - Cut and Paste | 141A - Amusing Joke |
112A - Petya and Strings | 677A - Vanya and Fence |
1621A - Stable Arrangement of Rooks | 472A - Design Tutorial Learn from Math |
1368A - C+= | 450A - Jzzhu and Children |
546A - Soldier and Bananas | 32B - Borze |
1651B - Prove Him Wrong | 381A - Sereja and Dima |
41A - Translation | 1559A - Mocha and Math |
832A - Sasha and Sticks | 292B - Network Topology |
1339A - Filling Diamonds | 910A - The Way to Home |
617A - Elephant | 48A - Rock-paper-scissors |
294A - Shaass and Oskols | 1213A - Chips Moving |
490A - Team Olympiad | 233A - Perfect Permutation |
1360A - Minimal Square | 467A - George and Accommodation |
893C - Rumor | 227B - Effective Approach |
1534B - Histogram Ugliness | 1611B - Team Composition Programmers and Mathematicians |