题解 | 句子逆序

#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define INF 0x7fffffff
#define inf 0x3f3f3f3f
#define PII pair<int,int>
#define endl '\n'
#define int long long
#define double long double
#define mod 998244353
int read() {char act = 0;int f = 1, x= 0;while (act = getchar(), act < '0' && act != '-');if (act == '-') f = -1, act = getchar();x = act - '0';while (act = getchar(), act >= '0') x = x * 10 + act - '0';return x * f;}
void solve(){
    string s;
    getline(cin,s);
    vector<string>a;
    while(s.find(' ')!=-1){
        int idx=s.find(' ');
        a.push_back(s.substr(0,idx));
        s=s.substr(idx+1);
    }
    a.push_back(s);
    reverse(a.begin(),a.end());
    for(int i=0;i<a.size();i++){
        if(i!=a.size()-1)cout<<a[i]<<" ";
        else cout<<a[i]<<endl;
    }
}
signed main()
{
    IOS; 
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }

    return 0;
}