九度oj-Zero-complexity Transposition
2015-11-15 22:01
405 查看
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:3102
解决:1262
题目描述:
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.
样例输入:
样例输出:
来源:2007年上海交通大学计算机研究生机试真题
内存限制:32 兆
特殊判题:否
提交:3102
解决:1262
题目描述:
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
来源:2007年上海交通大学计算机研究生机试真题
#include<iostream> using namespace std; long long a[10005]; int main() { int n,i; while(cin>>n) { for(i=0;i<n;i++) cin>>a[i]; for(i=n-1;i>0;i--) cout<<a[i]<<" "; cout<<a[0]<<endl; } return 0; }
相关文章推荐
- 九度1526
- 九度1025:最大报销额 java
- 九度 题目1026:又一版 A+B java
- 【九度】题目1006:ZOJ问题
- 【九度】题目1005:Graduate Admission
- 【九度】题目1004:Median
- 【九度】题目1003:A+B
- 【九度】题目1002:Grading
- 【九度】题目1001:A+B for Matrices
- 【九度】题目1000:计算a+b
- 三、Hash练习_1156_1
- 三、Hash_1081_1
- 给定两个整数A和B,其表示形式是:从个位开始,每三位数用逗号","隔开。
- 并查集
- JOBDU Q1001
- JOBDU Q1002
- JOBDU Q1003
- JOBDU Q1004
- 九度题目1431解
- 九度--第1001题:A+B for Matrices