题目1039:Zero-complexity Transposition---------AC
AC:
#include<iostream> using namespace std; long long a[10000]; int main() { int n; while(cin>>n) { int i=0,k=0; for (i=0;i<n;i++) cin>>a[k++]; for(i=k-1;i>0;i--) cout<<a[i]<<" "; cout<<a[0]<<endl; } return 0; }