TOJ1153. Word Reversal

1153.   Word Reversal

---

Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 5327   Accepted Runs: 2132    Multiple test files

---

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

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

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

#include<iostream>
#include<stack>
using namespace std;
#include<string.h>
#include<stdio.h>
stack<char> s;
char str[1000];
int main()
{
    int n,i,len;
    cin>>n;
    getchar();
    while(n--)
    {
       //cin>>str;
      gets(str);
       len=strlen(str);
       i=0;
       while(1)
       {
          while(str[i]!=' '&&i<len)
          {
              s.push(str[i]);
              i++;
          }
          while(!s.empty())
          {
             cout<<s.top();
             s.pop();
          }
          if(i!=len)
          {
              cout<<' ';
              i++;
          }
          else break;
        
       }
       cout<<endl;
          
  
    }
    return 0;
}