Codeforces 1462A. Favorite Sequence Solution

   Solution in C++:

///**********ALLAH IS ALMIGHTY************///

///AH Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh  

1. #include <bits/stdc++.h>
2. using namespace std;
3. int main()
4. {
5. int t,n,i;
6. cin>>t;
7. while(t--)
8. {
9. cin>>n;
10. int a[n+5];
11. for(i=0; i<n; i++)
12. {
13. cin>>a[i];
14. }
15. if(n%2==0)
16. {
17. for(i=0; i<n/2; i++)
18. cout<<a[i]<<" "<<a[n-1-i]<<" ";
19. }
20. else
21. {
22. for(i=0; i<n/2; i++)
23. cout<<a[i]<<" "<<a[n-1-i]<<" ";
24. cout<<a[n/2]<<endl;
25. }
26. cout<<endl;
27. }
28. }