#include<bits/stdc++.h>
#define i64 long long
#define mx(a,b,c) max(a,max(b,c))
#define mn(a,b,c) min(a,min(b,c))
#define eef else if
#define ff(i,s,e) for(int i=(s); i<e; i++)
#define ff2(i,s,e) for(int i=(s); i>=e; i--)
#define sf scanf
#define pf printf
#define dbug(x) cout<<"x = "<<x<<endl
using namespace std;
int main()
{
string s;
int k=0 , j;
while(getline(cin,s,'\n')){
for(int i=0; i<=s.size(); i++){
if(s[i]==' ' || i==(s.size()-1)){
for(j=i; j>=k; j--){
if(s[j]!=' ')
cout<<s[j];
}
k=i;
if(i!=(s.size()-1))
cout<<" ";
}
}
cout<<endl;
k=0;
}
return 0;
}
#define i64 long long
#define mx(a,b,c) max(a,max(b,c))
#define mn(a,b,c) min(a,min(b,c))
#define eef else if
#define ff(i,s,e) for(int i=(s); i<e; i++)
#define ff2(i,s,e) for(int i=(s); i>=e; i--)
#define sf scanf
#define pf printf
#define dbug(x) cout<<"x = "<<x<<endl
using namespace std;
int main()
{
string s;
int k=0 , j;
while(getline(cin,s,'\n')){
for(int i=0; i<=s.size(); i++){
if(s[i]==' ' || i==(s.size()-1)){
for(j=i; j>=k; j--){
if(s[j]!=' ')
cout<<s[j];
}
k=i;
if(i!=(s.size()-1))
cout<<" ";
}
}
cout<<endl;
k=0;
}
return 0;
}
No comments:
Post a Comment