HDOJ #1002 A + B问题II acm大数相加问题

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1002
1.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.
对您来说，我有一个非常简单的问题。 给定两个整数A和B，您的工作是计算A + B的总和。

2.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.
2.输入
输入的第一行包含一个整数T（1 <= T <= 20），它表示测试用例的数量。然后是T行，每行由两个正整数A和B组成。请注意，这些整数非常大，这意味着您不应使用32位整数对其进行处理。您可以假设每个整数的长度不超过1000。

3.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.
3.输出
对于每个测试用例，您应该输出两行。第一行是“ Case＃：”，＃表示测试用例的编号。第二行是等式“ A + B = Sum”，Sum表示A + B的结果。请注意，该等式中有一些空格。在两个测试用例之间输出空白行。

4.Sample Input 输入样例
2
1 2
112233445566778899 998877665544332211

5.Sample Output 输出样例
Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110

思路：因为整数型已经存不下1000长度的数字，考虑使用字符串完成
把字符串倒序存入数组中，手动完成加法，进位算法。

c++ code:

#include<iostream>
#include <string>
using namespace std;
int main()
{
   
    string str1