zoj 1151 Word Reversal

Word Reversal

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

For each list of words, output a line with each word reversed without changing the order of the words.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Input

You will be given a number of test cases. The first line contains a positive integer indicating the number of cases to follow. Each case is given on a line containing a list of words separated by one space, and each word contains only uppercase and lowercase letters.

Output

For each test case, print the output on one line.

Sample Input

1

3
I am happy today
To be or not to be
I want to win the practice contest

Sample Output

I ma yppah yadot
oT eb ro ton ot eb
I tnaw ot niw eht ecitcarp tsetnoc

注意pe，PE的注意！

除了每个字符串输出后换行，而且每个block，（题目只有一个block）后面也要有换行！！

代码：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
#include<stack>
int main()
{
 int n,m;
 scanf("%d",&n);
 while(n--)
 {
   scanf("%d",&m);
   getchar();
  while(m--)
  {
  stack<char>z;
  char a[1010];
  char b,v;
  int i,j,len;
  gets(a);
  len=strlen(a);
  a[len]=' ';
  for(i=0;i<=len;i++)
  {
   if(a[i]!=' ')
   {
    z.push(a[i]); 
   }
   else
   {
    while(!z.empty() )
    {
     b=z.top() ;
     printf("%c",b);
     z.pop() ;
    }
    if(i!=len)
    printf(" ");
   }
  }
  printf("\n");
  }
  if(n)//格式！！！ 
  printf("\n");
    }
 return 0;
}