HDU OJ 1002 A + B Problem II
来源:互联网 发布:urp 数据库 编辑:程序博客网 时间:2024/05/18 03:10
A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 372473 Accepted Submission(s): 72570
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
21 2112233445566778899 998877665544332211
Sample Output
Case 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1008 1005 1093 1092 1009
代码实现:
import java.math.BigInteger;import java.util.Scanner;public class Main { // 注意提交的时候要 改为Main public static void main(String args[]){ Scanner s=new Scanner(System.in); int n=s.nextInt(); for(int i=1;i<=n;i++){ BigInteger a=s.nextBigInteger(); BigInteger b=s.nextBigInteger(); BigInteger c=a.add(b); if(i>1) System.out.println(); System.out.println("Case "+(i)+":"); System.out.println(a.toString()+" + "+b.toString()+" = "+c.toString()); } }}// 建议 用java做 因为 BigInteger 理论上可以表示无限大的数只要内存够 // 如果用C的话 就要考虑 用字符串的相加来做。提交代码
阅读全文
0 0
- hdu-oj 1002 A + B Problem II
- Hdu oj 1002 A + B Problem II
- HDU OJ 1002 A + B Problem II
- HDU oj A + B Problem II
- Hdu oj 1002 A + B Problem II(大数加法)
- [HDU OJ记录]题1002 A + B Problem II
- 杭电HDU OJ A + B Problem II ID1002 AC
- HDU 1002 A + B Problem II
- HDU 1002A + B Problem II
- HDU 1002 - A + B Problem II
- HDU 1002 A + B Problem II
- HDU 1002 A + B Problem II
- HDU 1002 A + B Problem II
- HDU 1002 A + B Problem II
- HDU 1002 A + B Problem II
- hdu 1002 A+B Problem II
- HDU 1002 A + B Problem II
- hdu 1002 A + B Problem II
- 303. Range Sum Query
- 短实习---java数组(基础知识)
- Python3.5 email发送邮件,包含txt、图片、HTML、附件
- 鸡蛋栈
- Apache POI实现数据的Excel导出
- HDU OJ 1002 A + B Problem II
- 独一无二的私有云车牌识别系统API
- java web 新框架的使用和旧知识的复习
- Unsupported major.minor version 52.0
- [编程题] 扑克牌大小
- 关于Web Worker你必须知道的7件事
- 技术文章 | spring boot项目中使用jpa的一个未解之谜
- 现代OpenGL+Qt学习笔记之四:使用Uniform变量实现对模型的旋转
- HDU OJ 1003 Max Sum