#include <iostream>
#include <stack>
#include <cstdio>
using namespace std;
int main(){
int n;
while (scanf("%d",&n) != EOF && n > 0 && n <=10000){
stack<int> sta;
int a;
for(int i = 0;i < n; i++){
scanf("%d",&a);
sta.push(a);
}
for(int i= 0;i < n;i++){
if(i == n-1){
printf("%d\n",sta.top());//queue和stack都不能x[i]取元素
}else{
printf("%d ",sta.top());
}
sta.pop();
}
}
return 0;
}
Zero-complexity Transposition
最新推荐文章于 2021-12-28 19:47:24 发布