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

建议使用的浏览器:

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

1266:Reverse Number

题目描述
Welcome to 2006'4 computer college programming contest!

Specially, I give my best regards to all freshmen! You are the future of HDU ACM! And now, I must tell you that ACM problems are always not so easy, but, except this one... Ha-Ha!

Give you an integer; your task is to output its reverse number. Here, reverse number is defined as follows:
1. The reverse number of a positive integer ending without 0 is general reverse, for example, reverse (12) = 21;
2. The reverse number of a negative integer is negative, for example, reverse (-12) = -21;
3. The reverse number of an integer ending with 0 is described as example, reverse (1200) = 2100.
输入解释
Input file contains multiple test cases. There is a positive integer n (n<100) in the first line, which means the number of test cases, and then n 32-bit integers follow.
输出解释
For each test case, you should output its reverse number, one case per line.
输入样例
3
12
-12
1200
输出样例
21
-21
2100
来自杭电HDUOJ的附加信息
Author lcy
Recommend lxj

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

源链接: HDU-1266

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

共提交 3

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