落絮飞雁

顺流而下,把梦做完

HDOJ1002:A + B Problem II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 210904 Accepted Submission(s): 40642
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:
112233445566778899 + 998877665544332211 = 1111111111111111110

记得刚注册ACM账号的时候,在连续解决掉1000和1001这两道问题后。就毫不犹豫的点开了1002。

快一年了……终于把这个坑补完了。

先放上来,等我仔细研究之后再放代码吧。


原文标题:HDOJ1002:A + B Problem II|落絮飞雁的个人网站
原文链接:https://www.luoxufeiyan.com/2014/08/07/hdoj1002%ef%bc%9aa-b-problem-ii/
授权协议:创作共用 署名-非商业性使用 2.5 中国大陆
除注明外,本站文章均为原创;转载时请保留上述链接。