【杭电 OJ】1002 A + B Problem II

最新推荐文章于 2024-11-08 01:28:33 发布

「已注销」

最新推荐文章于 2024-11-08 01:28:33 发布

阅读量380

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/SmilngSalesman/article/details/79165182

本文介绍了一种解决大数相加问题的方法，不使用整型数组，而是利用字符串存储大数，并通过翻转字符串实现逐位相加。适用于长度不超过1000的大数运算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 397538 Accepted Submission(s): 76973

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

1 2

112233445566778899 998877665544332211

Sample Output

Case 1:

1 + 2 = 3

Case 2:

112233445566778899 + 998877665544332211 = 1111111111111111110

Author

Ignatius.L

Recommend

We have carefully selected several similar problems for you: 1000 1004 1003 1008 1005

1.不能用 ull

2.不能用整型数组（不然那一大串都是一个数）

①string储存数据，用数组倒置接口reverse()翻转字符串，逐位相加，最后再导倒置数组即可

②