#include <bits/stdc++.h>using namespace std;int t, p, q, i;string a, b;int main() {cin >> t;while (t--) {int A[5002] = {0}, B[5002] = {0};cin >> a >> b;p = a.length();q = b.length();//将字符串 a 和 b 转换为数组 A 和 B,并反转顺序以便从最低位开始相加。for (i = 0; i < p; i++)A[i] = a[p - i - 1] - '0';for (i = 0; i < q; i++)B[i] = b[q - i - 1] - '0';//逐位相加 A 和 B,处理进位。for (i = 0; i < max(p, q); i++) {A[i] += B[i];A[i + 1] += A[i] / 10;A[i] %= 10;}//找到结果的最高位实现前导零while (i > 0 &amp;&amp; A[i] == 0) i--;//然后从最高位开始输出for (; i >= 0; i--) cout << A[i];cout << endl;}return 0;}