Text Reverse

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

3
olleh !dlrow
m'I morf .udh
I ekil .mca

 

Sample Output

hello world!
I'm from hdu.
I like acm.

#include<stdio.h>
#include<string.h>
#define N 1010
int main()
{
    int n,i,j,m,len;
    char st[N]={0};
    while(~scanf("%d%*c",&n))
    {
       while(n--)
       {
           gets(st);
           len=strlen(st);
           m=0;
           for(i=0;i<=len;i++)
           {
               if(st[i]==' '||st[i]=='\0')
               {
                   for(j=i-1;j>=m;j--)
                    printf("%c",st[j]);
                   if(st[j]!='\0')
                    printf(" ");
                   m=i;
               }
           }
           printf("\n");
       }
    }
    return 0;
}

其实这道题想了很久，开始把思维定在用两个数组，当st[j]!=' '时st2[j]=st[j]，但是这样不容易实现。今天发现用一个数组就行，循环条件改一下就OK了，汗啊。。。。

还好做出来了