题目1039:Zero-complexity Transposition
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:3927
解决:1579
-
题目描述:
-
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
-
-
#include<stdio.h> #include<string.h> long long a[10005]; int main(){ int n; while(scanf("%d",&n)!=EOF){ int i,j; memset(a,0,10005*sizeof(long long)); for(i=0;i<n;i++){ scanf("%lld",&a[i]); } if(n>1){ for(j=n-1;j>0;j--) printf("%lld ",a[j]); } printf("%lld\n",a[0]); } return 0; }