HDOJ1266 Reverse Number
来源:互联网 发布:cf领活动软件 编辑:程序博客网 时间:2024/06/05 19:06
Reverse Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10371 Accepted Submission(s): 4625
Problem Description
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.
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
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.
Output
For each test case, you should output its reverse number, one case per line.
Sample Input
312-121200
Sample Output
21-212100
一个个加到string 里面,后面的0统计一下,最后加上。
import java.util.Scanner;public class Main{private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);int cases = scanner.nextInt();while (cases-- > 0) {int n = scanner.nextInt();if (n == 0) {System.out.println(0);continue;}String string = "";if (n < 0) {string += "-";n = -n;}int count = 0;boolean boo = true;while (n > 0) {if (n % 10 != 0 || !boo) {string += ("" + n % 10);boo = false;} else if (n % 10 == 0 && boo) {count++;}n /= 10;}for (int i = 0; i < count; i++) {string += ("" + 0);}System.out.println(string);}}}
阅读全文
0 0
- HDOJ1266 Reverse Number
- Reverse Number
- Reverse Number
- reverse number
- HDU 1266 Reverse Number
- HDU 1266 Reverse Number
- HDU1266:Reverse Number
- 问题九十七:Reverse Number
- Reverse a positive number
- hdu1266(Reverse Number)
- 【HDIJ】1266 -> Reverse Number
- HDU 1266 Reverse Number
- hdu1266 Reverse Number
- hdoj 1266 Reverse Number
- 1244: Reverse Number
- Reverse Number hdoj 1266
- HDU 1266 Reverse Number
- hdoj 1266 Reverse Number
- Qt中 QString 和int, char等的“相互”转换,关键是QString.toLocal8Bit().data();(转载)
- lua项目思想日常解读【1】
- 前端代码重构和解耦
- Cache解决POST请求重复发送的问题
- mysql root账户看不到数据库
- HDOJ1266 Reverse Number
- Java异常机制Throwable
- 缓存基本概念
- game
- mysql基本知识点
- ubuntu关闭、开启防火墙
- 马化腾教你做产品:改掉这七点,让产品自己说话
- 3-1·umask权限总结
- 对Java Serializable(序列化)的理解和总结