高精度加法
两个大数的高精度加法:
模板题题目连接:https://www.acwing.com/problem/content/793/
代码vector add(vector &A, vector &B)
{
if (A.size() = 0
vector sub(vector &A, vector &B)
{
vector C;
for (int i = 0, t = 0; i = 0
vector mul(vector &A, int b)
{
vector C;
int t = 0;
for (int i = 0; i = 0, b > 0
vector div(vector &A, int b, int &r)
{
vector C;
r = 0;
for (int i = A.size() - 1; i >= 0; i -- )
{
r = r * 10 + A[i];
C.push_back(r / b);
r %= b;
}
reverse(C.begin(), C.end());
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
Python
因为python的int本身就是一个大数,所以如果有大数类的题目,可以直接使用python写