AcWing 791. 高精度加法
原题链接
简单
作者:
NeonSean
,
2020-08-17 15:38:42
,
所有人可见
,
阅读 377
#include <iostream>
#include <vector>
using namespace std;
const int N = 1e6 + 10;
vector<int> add(vector<int> &A, vector<int> &B) {
vector<int> C;
int t = 0;
for (int i = 0; i < A.size() || i < B.size(); i++) {
if (i < A.size()) t += A[i];
if (i < B.size()) t += B[i];
C.push_back(t % 10);
t = t / 10;
}
if (t) C.push_back(1);
return C;
}
int main() {
string a, b;
vector<int> A, B, res;
cin >> a >> b;
for (int i = a.size() - 1; i >= 0; i--) A.push_back(a[i] - '0');
for (int i = b.size() - 1; i >= 0; i--) B.push_back(b[i] - '0');
res = add(A, B);
for (int i = res.size() - 1; i >= 0; i--) cout << res[i];
cout << endl;
return 0;
}
shafa