描述:
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 位輸出請(qǐng)用 printf("%lld")
提交結(jié)果:
文章來(lái)源:http://www.zghlxwxcb.cn/news/detail-643020.html
?文章來(lái)源地址http://www.zghlxwxcb.cn/news/detail-643020.html
到了這里,關(guān)于[保研/考研機(jī)試] KY109 Zero-complexity Transposition 上海交通大學(xué)復(fù)試上機(jī)題 C++實(shí)現(xiàn)的文章就介紹完了。如果您還想了解更多內(nèi)容,請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章,希望大家以后多多支持TOY模板網(wǎng)!