当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1062:Text Reverse

题目描述
Ignatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words and then output them.
输入解释
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case contains a single line with several words. There will be at most 1000 characters in a line.
输出解释
For each test case, you should output the text which is processed.
输入样例
3
olleh !dlrow
m'I morf .udh
I ekil .mca
输出样例
hello world!
I'm from hdu.
I like acm.

提示
Remember to use getchar() to read '\n' after the interger T, then you may use gets() to read a line and process it.
来自杭电HDUOJ的附加信息
Author Ignatius.L
Recommend

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1062

最后修改于 2020-10-25T22:41:50+00:00 由爬虫自动更新

共提交 417

通过率 57.79%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/32768K(Java/Others)