描述:
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.
示例1:
输入:
5
-3 4 6 -8 9
输出:
9 -8 6 4 -3
源代码:
#include<iostream>
#include<stack>
using namespace std;
//例题5.4 Zero-complexity Transposition
int main()
{
int n;
cin >> n;
stack<int> myStack;
for (int i = 0; i < n; i++) {
int temp = 0;
cin >> temp;
myStack.push(temp);
}
cout << myStack.top();
myStack.pop();
while (!myStack.empty()) {
cout << " " << myStack.top();
myStack.pop();
}
cout << endl;
return 0;
}
// 64 位输出请用 printf("%lld")
提交结果:
文章来源:https://www.toymoban.com/news/detail-643020.html
文章来源地址https://www.toymoban.com/news/detail-643020.html
到了这里,关于[保研/考研机试] KY109 Zero-complexity Transposition 上海交通大学复试上机题 C++实现的文章就介绍完了。如果您还想了解更多内容,请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章,希望大家以后多多支持TOY模板网!