Text Reverse hdoj 1062

/*
Text Reverse

http://acm.hdu.edu.cn/showproblem.php?pid=1062

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

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.

Hint

Remember to use getchar() to read '\n' after the interger T, then you may use gets() to read a line and process it.
 
 

Author
Ignatius.L
 

Recommend
We have carefully selected several similar problems for you:  1073 1088 1113 1043 1200
*/

看实例就知道要干嘛的。。。不过还是花了我一点工夫！
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define M 1000
char s[M];
char a[M];
int main()
{
 int T;
 scanf("%d",&T);
 getchar();   //这个还是不能忘啊！
 while(T--)
 {
  memset(s,0,sizeof(s));
  gets(s);
  int i,j,k,len;
  len=strlen(s);
  
  memset(a,0,sizeof(a));
    
  for(i=0;i<len;)
  {
   
    /*
    j=0;
   int t=i;
   while((s[t]!=' '))
    {
     a[j++]=s[t];
     t++;
    }
     */

  if(s[i]==' ')
   {
    
   printf(" ");
   i++; 
   }
    else
     {
       j=0;
       int t=i;
     while((s[t]!=' ')&&s[t]!='\0')//把每个单词存储起来，存储一个，输出一个；
      {
       a[j++]=s[t];
       t++;
      }
     int p=j;
     for(k=p-1;k>=0;k--)
      printf("%c",a[k]);
      i+=p;这一步至关重要，我想了好久，不是i++;因为这个过程中你用掉了一个单词的长度；
     }
   
  }
  printf("\n");
 }
 return 0;
}