杭电oj-1002 A + B Problem II

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

分析

大数加法。数字最多1000位，long long也不行。考虑用字符串，然后分别对每一位进行计算。计算每一位时同时要产生1或0的进位。 最后结果也存为 字符串。

注意

1. 两个数可能位数不一样，无法对齐，需要先将短的 数前面补齐0。
2. 两个数最前面都要补个0，以防产生进位。
3. 输出 结果时，前面的0 不输出。

代码

#include <iostream>
#include <string>
using namespace std;
string addlong(string a,string b){
    int n1,n2,num;
    char sum[1000];
    int i;
    for(n1 = 0;a[n1]!='\0';n1++){}
    for(n2 = 0;b[n2]!='\0';n2++){}
    if(n1>n2){
        for(i = 0;i<n1-n2;i++) {b = '0'+b;}
        num = n1;
    }
    if(n1<n2){
        for(i = 0;i<n2-n1;i++) {a = '0'+a;}
        num = n2;
    }
    else
        num = n1;
    int c = 0;
    sum[num] = '\0';
    for(i = num-1;i>=0;i--){
        int k = (a[i]-48)+(b[i]-48)+c;
        if(k>=10) {
            c = 1;
            sum[i] = k - 10 + 48;
        }
        else{
            c = 0;
            sum[i] = k + 48;
        }

    }
    string s="";
    int flag = 0;
    for(i = 0;sum[i]!='\0';i++){
        if(sum[i]!='0'||flag == 1) {s += sum[i];flag = 1;}
    }
    return s;
}
int main(){
    int n;
    cin>>n;
    int i = 1;
    while(n--){
       string str1,str2;
       cin>>str1>>str2;
       string a = "0",b = "0";
       a += str1;
       b += str2;
       cout<<"Case "<<i<<":"<<endl;
       i++;
       cout<<str1<<" + "<<str2<<" = "<<addlong(a,b)<<endl;
       if(n) cout<<endl;
    }


    return 0;
}