|
Problem Description
Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.
|
Input
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line. |
Output
For each test case, you should output the text which is processed.
|
Sample Input
|
Sample Output
|
#include<iostream>
#include<string.h>
using namespace std;
int main(){
int n,t;
char temp;
char a[10001];
cin>>n;
getchar();
for(int i=0;i<n;i++){
gets(a);
t=0;
int length=strlen(a);
for(int j=0;j<=length;j++)
{
if(a[j]==' '||a[j]=='\0')
{
for(int m=t;m<(t+j)/2;m++)
{ temp=a[m];
a[m]=a[j+t-m-1];
a[j+t-m-1]=temp;
}
t=j+1;
}
}
for(int q=0;q<length;q++)
cout<<a[q];
cout<<endl;
}
}