#include <bits/stdc++.h>
using namespace std;
int a[505],b[505],c[505];
char num1[505],num2[505];
int main()
{
cin >> num1;
cin >> num2;
int n = strlen(num1);
int m = strlen(num2);
for(int i = 0; i < n; i++) a[n-i] = num1[i] - '0';
for(int i = 0; i < m; i++) b[m-i] = num2[i] - '0';
int l = max(n,m) + 1;
for(int i = 1; i <= l; i++){
c[i] += a[i] + b[i];
c[i+1] = c[i] / 10;
c[i] = c[i] % 10;
}
while(c[l] == 0 && l > 1) l--;
for(int i = l; i > 0; i--){
cout << c[i];
}
return 0;
}
P1601 A+B Problem(高精)
最新推荐文章于 2024-09-11 00:16:09 发布