#include<iostream>
#include<stack>
using namespace std;
int main()
{
int n;
int i;
double item;
stack<double>numbers;
cin>>n;
for( i =0; i<n; i++)
{
cin>>item;
numbers.push(item);
}
while(!numbers.empty()) //循环条件:栈是否为空
{
cout<<numbers.top()<<" "; //读取栈顶元素
numbers.pop(); //出栈(即删除栈顶元素)
}
cout<<endl;
return 0;
}
#include<stack>
using namespace std;
int main()
{
int n;
int i;
double item;
stack<double>numbers;
cin>>n;
for( i =0; i<n; i++)
{
cin>>item;
numbers.push(item);
}
while(!numbers.empty()) //循环条件:栈是否为空
{
cout<<numbers.top()<<" "; //读取栈顶元素
numbers.pop(); //出栈(即删除栈顶元素)
}
cout<<endl;
return 0;
}