AcWing 1. A + B
原题链接
简单
作者:
赐荒
,
2025-04-13 22:21:26
· 新疆
,
所有人可见
,
阅读 1
#include<bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int la = s1.size(), lb = s2.size(), lc = max(la, lb) + 1;
vector<int> a(lc, 0), b(lc, 0), c(lc, 0);
for (int i = 1; i <= la; i++) a[i] = s1[la - i] - '0';
for (int i = 1; i <= lb; i++) b[i] = s2[lb - i] - '0';
for (int i = 1; i <= lc; i++) {
c[i] += a[i] + b[i];
if (c[i] > 9) {
c[i + 1] += c[i] / 10;
c[i] %= 10;
}
}
while (lc > 1 && c[lc] == 0) lc--;
for (int i = lc; i >= 1; i--) cout << c[i];
cout << endl;
return 0;
}