Text Reverse

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30268    Accepted Submission(s): 11966

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

3olleh !dlrowm'I morf .udhI ekil .mca

 

Sample Output

hello world!I'm from hdu.I like acm.
/*分类：字符串 来源：hdu Text Reverse思路：reverse We are giant.create by Songdan_Lee*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char s[1004];int main(){int T;//%*c读取一个字符，但是不放入任何变量 scanf("%d%*c",&T);while(T--){gets(s);int begin=0;for(int i=0;i<=strlen(s);i++){if(s[i]==' '||s[i]=='\0'){reverse(s+begin,s+i);begin=i+1;}}puts(s);}}