AcWing 791. 高精度加法 重载加号
原题链接
简单
作者:
Snrise
,
2024-04-16 19:33:12
,
所有人可见
,
阅读 1
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define int long long
#define endl '\n'
using namespace std;
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 /= 10;
}
if (t)
{
C.push_back(t);
}
return C;
}
signed main(void)
{
std::ios::sync_with_stdio(false);
string a, b;
cin >> a >> b;
vector<int> 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');
}
vector<int> C = add(A, B);
for (int i = C.size() - 1; i >= 0; i--)
{
cout << C[i];
}
cout << endl;
return 0;
}
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define int long long
#define endl '\n'
using namespace std;
vector<int> operator+(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 /= 10;
}
if (t)
{
C.push_back(t);
}
return C;
}
signed main(void)
{
std::ios::sync_with_stdio(false);
string a, b;
cin >> a >> b;
vector<int> 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');
}
vector<int> C = A + B;
for (int i = C.size() - 1; i >= 0; i--)
{
cout << C[i];
}
cout << endl;
return 0;
}