高精度加法
高精度加法模板
// C = A + B, A >= 0, B >= 0
vector<int> add(vector<int> &A, vector<int> &B)
{
if (A.size() < B.size()) return add(B, A);
vector<int> C;
int t = 0;
for (int i = 0; i < A.size(); i ++ )
{
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;
}
实现一个高精度加法样例:
#include<iostream>
#include<vector>
using namespace std;
vector<int> add(vector<int> &A, vector<int> &B)
{
vector<int> C;
//这里保证A的位数一定大于等于B
if (A.size() < B.size()) return add(B, A);
//t的作用是计算进位
int t = 0;
for (int i = 0; i < A.size(); i ++ )
{
//先将加数加上,至于是否加被加数,取决于该位上被加数有没有值
//比如:123+22,在百位的时候,被加数22就没有值,这个时候t就不需要加上B[i]
t += A[i];
if (i < B.size()) t += B[i];
//C对每一位都是加上t%10
//因为如果t < 10.t % 10 = t,t>=10,t % 10为其个位数
C.push_back(t % 10);
//获得进位的值,如果t < 10, t/10 = 0,进位为0
t /= 10;
}
//处理特殊情况,例如:88 + 99,两个都是2位数,但是结果为3位数
//这时候需要进位,只要t还有值,就只需要进1.
//因为,两个个位数相加不可能大于20,所以进位只能是1
if (t) C.push_back(1);
return C;
}
int main()
{
string a, b;
vector<int> A, B;
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');
auto C = add(A, B);
//因为C也是逆序存储的,所以打印的时候需要反向打印
for (int i = C.size() - 1; i >= 0; i -- ) printf("%d", C[i]);
return 0;
}
代码思想讲解、逐句讲解:
高精度减法
高精度减法模板
// C = A - B, 满足A >= B, A >= 0, B >= 0
vector<int> sub(vector<int> &A, vector<int> &B)
{
vector<int> C;
for (int i = 0, t = 0; i < A.size(); i ++ )
{
t = A[i] - t;
if (i < B.size()) t -= B[i];
C.push_back((t + 10) % 10);
if (t < 0) t = 1;
else t = 0;
}
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
实现一个高精度减法样例:
#include<iostream>
#include<vector>
using namespace std;
//比较A和B谁大
//cmp函数内容:如果A >= B,返回true.否则,返回false
bool cmp(vector<int> &A, vector<int> &B)
{
//如果A的长度和B不等,那么肯定一大一小,
//这时候返回A,.size() > B.size()
//如果A大,返回true,如果B大,返回false,符合比较逻辑
if (A.size() != B.size()) return A.size() > B.size();
//如果A和B的长度相同
for (int i = A.size() - 1; i >= 0; i -- )
if (A[i] != B[i])//一一比较每位数
return A[i] > B[i];//如果有某位数不相等,和上面的返回逻辑一样
//代码能走到这里,表示,长度相同,并且每位数相同,返回true
return true;
}
vector<int> sub(vector<int> &A, vector<int> &B)
{
vector<int> C;
for (int i = 0, t = 0; i < A.size(); i ++ )
{
//先减去A[i]
t = A[i] - t;
//如果此时B[i]也有值,也减去B[i]
if (i < B.size()) t -= B[i];
//往C中插入值
C.push_back((t + 10) % 10);
//探讨是否借位,如果借位,就需要t = 1,让下一位减掉t
if (t < 0) t = 1;
else t = 0;
}
//去除前导0,如果答案是064,那么应该输出64,需要把0去掉
while(C.size() > 1 && C.back() == 0) C.pop_back();
//条件C.size() > 1保证不是最后一个0,
//C.back() == 0表示C的最后一位是0,也就是前导0,因为C是逆序存储
return C;
}
int main()
{
string a, b;
vector<int> A, B;
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');
//这里需要考虑减数<被减数的情况,也就是答案是复数的情况
if (cmp(A, B))
{
//如果是正数,就直接输出
auto C = sub(A, B);
for (int i = b.size() - 1; i >= 0; i -- ) printf("%d", C[i]);
}
else
{
//如果是负数,先输出减号,再输出数
auto C = sub(B, A);
printf("-");
for (int i = C.size() - 1; i >= 0; i -- ) printf("%d", C[i]);
}
return 0;
}
高精度乘法
// C = A * b, A >= 0, b >= 0
vector<int> mul(vector<int> &A, int b)
{
vector<int> C;
int t = 0;
for (int i = 0; i < A.size() || t; i ++ )
{
if (i < A.size()) t += A[i] * b;
C.push_back(t % 10);
t /= 10;
}
while (C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}
实现一个高精度乘法样例:
#include<iostream>
#include<vector>
using namespace std;
vector<int> mul(vector<int> &A, int b)
{
vector<int> C;
int t = 0;
for (int i = 0; i < A.size() || t; i ++ )
{
if (i < A.size()) t += A[i] * b;
C.push_back(t % 10);
t /= 10;
}
return C;
}
int main()
{
string a;
int b;
cin >> a >> b;
vector<int> A;
for (int i = a.size() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
auto C = mul(A, b);
for (int i = C.size() - 1; i >= 0; i -- ) printf("%d", C[i]);
}
高精度除法
模板:
// A / b = C ... r, A >= 0, b > 0
vector<int> div(vector<int> &A, int b, int &r)
{
vector<int> 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;
}
实现一个高精度除法样例:
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> div(vector<int> &A, int b, int &r)
{
vector<int> 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;
}
int main()
{
string a;
int b;
cin >> a >> b;
vector<int> A;
for (int i = a.size() - 1; i >= 0; i -- ) A.push_back(a[i] - '0');
int r;
auto C = div(A, b, r);
for (int i = C.size() - 1; i >= 0; i -- ) printf("%d", C[i]);
cout << endl << r << endl;
return 0;
}