HDU 1002 A + B Problem II (JAVA大数)
来源:互联网 发布:程序员的思维锻炼 编辑:程序博客网 时间:2024/06/04 19:02
Problem Description
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.
Sample Input
2
1 2
112233445566778899 998877665544332211
Sample Output
Case 1:
1 + 2 = 3
Case 2:
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.
Sample Input
2
1 2
112233445566778899 998877665544332211
Sample Output
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
import java.math.BigInteger;import java.util.Scanner; public class Main { public static void main(String[] args) { BigInteger a, b; int T; Scanner in = new Scanner(System.in); T = in.nextInt(); for (int i = 1; i <= T; ++i) { System.out.println("Case" + " " + i + ":"); a = in.nextBigInteger(); b = in.nextBigInteger(); if (i < T) { System.out.println(a + " + " + b + " = " + a.add(b) ); System.out.println(); } else { System.out.println(a + " + " + b + " = " + a.add(b)); } } }}
1 0
- hdu - 1002 - A + B Problem II(Java大数)
- hdu 1002 A + B Problem II ( JAVA大数)
- HDU-1002 A + B Problem II Java大数
- hdu 1002 A + B Problem II(Java大数)
- HDU 1002 A + B Problem II (JAVA大数)
- HDU-1002-A + B Problem II [大数运算 | java语言]
- 大数A + B Problem II-hdu-1002
- HDU 1002--A + B Problem II【大数】
- HDU 1002 A + B Problem II 大数
- HDU-1002-A + B Problem II【大数】
- hdu 1102 A + B Problem II (java大数)
- hdu 1002 A + B Problem II (大数相加)
- HDU 1002 A + B Problem II 大数相加
- A + B Problem II 1002 hdu 大数模板
- HDU 1002 A + B Problem II大数相加
- HDU 1002 A+B Problem II 大数相加
- hdu 1002 A + B Problem II(大数模板)
- HDU 1002 A + B Problem II 【大数相加】(3.16)
- Python编写定时关机小脚本
- android的sql表单新增字段- alter table
- [pat]1105. Spiral Matrix (25)
- iOS之旅--用CollectionView实现轮播图效果+封装方法
- php mysql大数据处理
- HDU 1002 A + B Problem II (JAVA大数)
- IOS开发中新特性的实现
- K--近邻算法示例
- Codeforces Round #277 (Div. 2)(A)模拟,打表
- 贝塞尔曲线精讲
- C++第1次实验
- ora-01403:未找到任何数据
- Injection for Xcode 不用build 查看效果.类似于HTML 的F5
- Node.js最新技术栈之Promise篇