CF - 764B - Timofey and cubes - 思维

1.题目描述：

B. Timofey and cubes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

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].

2.题意概述：

给你一个交换过的序列，告诉你交换规则：对于第i次交换区间[i,n-i+1]的数，问你最初数列是怎么样的？

3.解题思路：

草稿纸模拟一下就好

例如长度为10

第一次交换[1,10]

第二次交换[2,9]

第三次交换[3,8]

第四次交换[4,6]

很容易发现如果这个位置是奇数则交换，如果是偶数则不变。但是考虑到长度会影响n-i+1的奇偶性，可以特判一下。

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 200100
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
inline bool scan_d(int &num)
{
	char in; bool IsN = false;
	in = getchar();
	if (in == EOF) return false;
	while (in != '-' && (in<'0' || in>'9')) in = getchar();
	if (in == '-') { IsN = true; num = 0; }
	else num = in - '0';
	while (in = getchar(), in >= '0'&&in <= '9') {
		num *= 10, num += in - '0';
	}
	if (IsN) num = -num;
	return true;
}
int a[maxn];
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n;
	while (scan_d(n))
	{
		for (int i = 1; i <= n; i++)
			scan_d(a[i]);
		if (n & 1)
		{
			for (int i = 1; i <= n; i++)
				if (i & 1)
				{
					if (i == 1)
						printf("%d", a[n - i + 1]);
					else
						printf(" %d", a[n - i + 1]);
				}
				else
					printf(" %d", a[i]);
		}
		else
		{
			for (int i = 1; i <= n; i++)
				if (i <= n / 2)
				{
					if (i & 1)
					{
						if (i == 1)
							printf("%d", a[n - i + 1]);
						else
							printf(" %d", a[n - i + 1]);
					}
					else
						printf(" %d", a[i]);
				}
				else
				{
					if (i & 1)
						printf(" %d", a[i]);
					else
						printf(" %d", a[n - i + 1]);
				}
		}
		puts("");
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}