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
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<algorithm> #include<string> using namespace std; int main() { //ifstream cin("aaa.txt"); string s="",ss=""; int m,n; char ch[81],a;; for(cin>>m;m>0;m--) { //cin>>a; cin.getline(ch,81); cin>>n; cin.getline(ch,81); for(;n>0;n--) { cin.getline(ch,81); s=ch; for(unsigned int i=0;i<s.size();i++) { if(s[i]!=' ')ss=s[i]+ss; else {cout<<ss<<" "; ss=""; } } cout<<ss<<endl; ss=""; } if(m!=1) cout<<endl; } return 0; }
