杭电Oj刷题Java(1002)

该博客介绍了杭电OJ(Online Judge)中的一道题目——A + B Problem II,主要任务是计算两个非常大的正整数A和B的和。输入包含测试用例的数量T和每组测试用例的两个整数,要求不使用32位整数处理。输出格式包括测试用例编号和计算结果。博客提供了样例输入和输出,帮助读者理解题意。
摘要由CSDN通过智能技术生成

A + B Problem II

题目描述:

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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值