1153. Word Reversal

一直是presentation error，后来终于解决了

输入字符串时，要先判断输入的是否为回车，然后再输出空格，不能弄反了，切记！

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

3I am happy todayTo be or not to beI want to win the practice contest

Sample Output

I ma yppah yadotoT eb ro ton ot ebI tnaw ot niw eht ecitcarp tsetnoc

#include<iostream>#include<string>#include<stdio.h>using namespace std;int main(){int n;string s;cin>>n;while(n--){//int flag=0;while(cin>>s){for(int i=s.length()-1;i>=0;i--)cout<<s[i];//flag=1;if(getchar()=='\n')break;cout<<" ";}cout<<endl;}return 0;}