ACM——hdu1002（高精度加法）

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.
(第一行输入一个数字T(1 <= T <= 20)代表输入的数据组数，其后输入T行，每行包含2个欲求和的数字A和B，由于这两个数非常大，这意味着你不能用32位整数来处理它们，同时，你可以假定每个数字不超过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.
(注意输出的格式，对于每一种案例，你需要输出两行，第一行为“Case#:”，指示这是第几个测试样例，第二行为一个公式”A + B = Sum”，Sum表示A加B的结果。注意在等式中有一些空格，在两个样例间输出一空白行。)
Sample Input
2
1 2
112233445566778899 998877665544332211

Sample Output
Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110

解题思路：

1. 首先用2个字符串存储要输入的两个加数A、B；
2. 去掉字符串中多余的0，比如0001改为1；
3. 将字符串转换为整型数组并倒序存储（ASCII中，‘1’-‘0’=1）；
4. 对A、B数组每一位进行加法运算，并存储在另一个数组中；
5. 按要求输