2013
12-12

# 九度-1039-Zero-complexity Transposition[解题代码]

You are given a sequence of integer numbers. Zero-complexity transposition of the sequence is the reverse of this sequence. Your task is to write a program that prints zero-complexity transposition of the given sequence.

For each case, the first line of the input file contains one integer n-length of the sequence (0 ＜ n ≤ 10 000). The second line contains n integers numbers-a1, a2, …, an (-1 000 000 000 000 000 ≤ ai ≤ 1 000 000 000 000 000).

For each case, on the first line of the output file print the sequence in the reverse order.

5
-3 4 6 -8 9

9 -8 6 4 -3

cpp 代码如下：
#include <stdio.h>
typedef long long ll;
ll arr[10001];
int n,i;
int main() {
while (scanf("%d", &n) != EOF) {
for ( i = n - 1; i >= 0; i--)
scanf("%lld", &arr[i]);
printf("%lld", arr[0]);
for (i = 1; i < n; i++)
printf(" %lld", arr[i]);
printf("\n");
}
return 0;
}
/**************************************************************
Problem: 1039
User: coder
Language: C
Result: Accepted
Time:0 ms
Memory:992 kb
****************************************************************/