CodeForces - 764B Timofey and cubes(模拟)

Posted Ying_zx

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了CodeForces - 764B Timofey and cubes(模拟)相关的知识,希望对你有一定的参考价值。

Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, which is written on it. Timofey put all the cubes in a row and went to unpack other presents.

In this time, Timofey‘s elder brother, Dima reordered the cubes using the following rule. Suppose the cubes are numbered from 1 to n in their order. Dima performs several steps, on step i he reverses the segment of cubes from i-th to (n?-?i?+?1)-th. He does this while i?≤?n?-?i?+?1.

After performing the operations Dima went away, being very proud of himself. When Timofey returned to his cubes, he understood that their order was changed. Help Timofey as fast as you can and save the holiday — restore the initial order of the cubes using information of their current location.

Input

The first line contains single integer n (1?≤?n?≤?2·105) — the number of cubes.

The second line contains n integers a1,?a2,?...,?an (?-?109?≤?ai?≤?109), where ai is the number written on the i-th cube after Dima has changed their order.

Output

Print n integers, separated by spaces — the numbers written on the cubes in their initial order.

It can be shown that the answer is unique.

Example
Input
7
4 3 7 6 9 1 2
Output
2 3 9 6 7 1 4
Input
8
6 1 4 2 5 6 9 2
Output
2 1 6 2 5 4 9 6
Note

Consider the first sample.

  1. At the begining row was [2, 3, 9, 6, 7, 1, 4].
  2. After first operation row was [4, 1, 7, 6, 9, 3, 2].
  3. After second operation row was [4, 3, 9, 6, 7, 1, 2].
  4. After third operation row was [4, 3, 7, 6, 9, 1, 2].
  5. At fourth operation we reverse just middle element, so nothing has changed. The final row is [4, 3, 7, 6, 9, 1, 2]. So the answer for this case is row [2, 3, 9, 6, 7, 1, 4].

直接模拟一遍就好,规律明显。

 1 #include <iostream>
 2 using namespace std;
 3 main () {
 4 int n;
 5 cin>>n;
 6 int a[n];
 7 for(int i=0;i<n;i++)
 8 cin>>a[i];
 9 for(int i=0;i<n/2;i+=2)
10 swap(a[i],a[n-i-1]);
11 for(int i=0;i<n;i++)
12 cout<<a[i]<< ;
13 }

 

以上是关于CodeForces - 764B Timofey and cubes(模拟)的主要内容,如果未能解决你的问题,请参考以下文章

Codeforces 763 A. Timofey and a tree (dfs)

Codeforces 763A. Timofey and a tree

CF 763A Timofey and a tree(思维题)

Codeforces 764 A-B

cf 764A762A764B

cf 763B. Timofey and rectangles