# 最新修改过的代码
```
#include<bits/stdc++.h>
using namespace std;
#define tin int
#define itn int
#define tni int
#define nit int
#define nti int
#define tn int
#define ti int
#define nt int
#define fr for
#define wh while
#define in cin
#define out cout
#define ll long long
#define longlong long long
#define shrt sort
#define re return
int main(){
nit s;
in>>s;
longlong a[s];
fr(nt i=0;i<s;i++){
in>>a[i-1];
}
fr(nt j=s;j>0;j--){
cout<<a[j-2]<<endl;
}
return 0;
}
```
by wing_离殇 @ 2019-04-10 13:38:06
# 一样是RE
by wing_离殇 @ 2019-04-10 13:39:18
@[呵呵一笑](/space/show?uid=171253) in 是 c++ 关键词吧。。。
by Cesare @ 2019-04-10 13:42:05
##### @[Cesare](/space/show?uid=104379)
### 但编译过了啊
by wing_离殇 @ 2019-04-10 13:47:48
该去机房了
by wing_离殇 @ 2019-04-10 13:48:01
有消息请加“@”
by wing_离殇 @ 2019-04-10 13:48:21
#include<iostream>
#include<cctype>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
#include<string>
#include<cstring>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
using namespace std;
#define O2 ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main()
{
O2;
int a,n=0;
stack<int>st;
while(cin>>a){
st.push(a);
if(a==0){
break;
}
}
st.pop();
n=st.size();
while(!st.empty()){
cout<<st.top()<<" ",st.pop();
}
return 0;
}
by 咕_gu @ 2019-09-26 16:09:07
用栈做的
by 咕_gu @ 2019-09-26 16:09:26