把每个单词以字符串形式压入栈中,然后每次输出栈顶元素即可(先入后出)
#include <iostream>
#include <cstdio>
#include <stack>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
stack<string> v;
string s;
while(cin>>s) v.push(s);
cout<<v.top();
v.pop();
while(!v.empty())
{
cout<<" "<<v.top();
v.pop();
}
return 0;
}