All Tracks Algorithms String Algorithms Basics of String Manipulation Problem

Nobita and String
/

Ad-Hoc, Implementation

Problem
Editorial
Analytics

Doraemon gave Nobita a gadget that swaps words inside a string in the following manner :

If there are W words, word 1 is swapped with word W, word 2 is swapped with word W-1 and so on. The problem is that Nobita himself cannot verify the answer for large strings. Help him write a program to do so.

INPUT :
the first line of the input contains the number of test cases. Each test case consists of a single line containing the string.

OUTPUT :
output the string with the words swapped as stated above.

CONSTRAINTS :
|string length| <= 100000
string contains english alphabets and spaces

SAMPLE INPUT
1
hello world
SAMPLE OUTPUT
world hello
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

This Problem was Asked in

Initializing Code Editor...
Notifications
View All Notifications

?