A - A + B 问题 II

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

Inputcopy	Outputcopy
2 1 2 112233445566778899 998877665544332211	Case 1: 1 + 2 = 3 Case 2: 112233445566778899 + 998877665544332211 = 1111111111111111110

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

// 定义最大数字长度，这里假设每个数字的长度不会超过1000
#define MAX_LEN 1001

// 用于存储大整数的结构
typedef struct {
    char number[MAX_LEN];
} BigNumber;

// 读取输入的大整数
void readBigNumber(BigNumber *num) {
    scanf("%s", num->number);
}

// 将两个大整数相加
void addBigNumbers(BigNumber *a, BigNumber *b, BigNumber *result) {
    int len_a = strlen(a->number);
    int len_b = strlen(b->number);
    int max_len = len_a > len_b ? len_a : len_b;
    
    // 进位标志
    int carry = 0;
    int sum;
    
    result->number[max_len] = '\0';  // 结果的最后一位为字符串结束符
    
    // 从最低位开始逐位相加
    for (int i = 0; i < max_len; i++) {
        int digit_a = (i < len_a) ? a->number[len_a - 1 - i] - '0' : 0;
        int digit_b = (i < len_b) ? b->number[len_b - 1 - i] - '0' : 0;
        sum = digit_a + digit_b + carry;
        result->number[max_len - 1 - i] = (sum % 10) + '0';
        carry = sum / 10;
    }
    
    // 如果有进位，需要在结果前面加上'1'
    if (carry) {
        for (int i = max_len; i > 0; i--) {
            result->number[i] = result->number[i - 1];
        }
        result->number[0] = '1';
    }
}

// 打印结果
void printResult(int caseNumber, BigNumber *a, BigNumber *b, BigNumber *sum) {
    printf("Case %d:\n%s + %s = %s\n", caseNumber, a->number, b->number, sum->number);
    if (caseNumber > 0) {
        printf("\n");
    }
}

int main() {
    int T;
    scanf("%d", &T);

    BigNumber a, b, sum;

    // 逐个读取和处理测试用例
    for (int i = 1; i <= T; i++) {
        readBigNumber(&a);
        readBigNumber(&b);
        addBigNumbers(&a, &b, &sum);
        printResult(i, &a, &b, &sum);
    }

    return 0;
}

详细解释：

1. 定义常量和结构体：

   • #define MAX_LEN 1001 定义大整数的最大长度，包括字符串结束符。
   • typedef struct { char number[MAX_LEN]; } BigNumber; 定义一个结构体用于存储大整数。

2. 读取大整数：

   • void readBigNumber(BigNumber *num) 函数读取一个大整数并存储在BigNumber结构体中。

3. 大整数相加：

   • void addBigNumbers(BigNumber *a, BigNumber *b, BigNumber *result) 函数将两个大整数相加。
   • 计算两个整数的长度，并从最低位开始逐位相加，同时处理进位。

4. 打印结果：

   • void printResult(int caseNumber, BigNumber *a, BigNumber *b, BigNumber *sum) 函数打印结果，按照题目要求的格式输出。

5. 主函数：

   • int main() 读取测试用例数，并逐个处理每个测试用例，最后输出结果。