九度oj-Zero-complexity Transposition
来源:互联网 发布:蒙泰怎样正确设置端口 编辑:程序博客网 时间:2024/04/27 23:53
- 题目描述:
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;}
0 0
- 九度oj-Zero-complexity Transposition
- [九度OJ]: 1039 Zero-complexity Transposition
- 九度OJ 题目1039:Zero-complexity Transposition
- 题目1039:Zero-complexity Transposition 九度OJ
- 九度OJ 1039:Zero-complexity Transposition(逆置) (基础题)
- 1039.Zero-complexity Transposition
- 题目1039:Zero-complexity Transposition
- 题目1039:Zero-complexity Transposition
- 题目1039:Zero-complexity Transposition
- 题目1039:Zero-complexity Transposition
- 题目1039:Zero-complexity Transposition
- 【九度OJ】:九度OJ 1050
- 【九度OJ】:九度OJ 1053
- 【九度OJ】:九度OJ 1056
- 【九度OJ】:九度OJ 1059
- 【九度OJ】:九度OJ 1206
- 九度OJ:1000
- 【九度OJ】 1006
- 二维数组的排序
- HashMap 源代码
- Dex动态加载的C语言部分
- 本周学习计划
- [1040]:As Easy As A+B(将输入的数排序)
- 九度oj-Zero-complexity Transposition
- CentOS7配置Ngnix+PHP
- 【远程管理】Mac下的putty远程管理软件
- NIO的简单例子
- 待机、睡眠和休眠的区别
- nyoj--1058--部分和问题(dfs)
- VS2010 Meshlab编译
- 【“知原理”检验题目——第11周】
- sublime text 3 无法通过pacakage controll 打开pacakage install解决办法