高精度模板:
高精度+高精度
vector<int> add(vector<int> &A, vector<int> &B)
{
vector<int> res;
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];
res.push_back(t % 10);
t /= 10;
}
if(t) res.push_back(t);
return res;
}
高精度-高精度
ps:需要多个判断函数保证始终是大数-小数
//判断A是否>B
bool cmp(vector<int> &A, vector<int> &B)
{
if(A.size() != B.size()) return A.size() > B.size();
for(int i = A.size() - 1; i >= 0; i -- )
if(A[i] != B[i])
return A[i] > B[i];
return true;
}
vector<int> sub(vector<int> &A, vector<int> &B)
{
vector<int> C;
int t = 0;
for(int i = 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;
}
高精度*低精度
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;
}
高精度/低精度
ps:为了方便与其他三种结合运算因此也倒着存,倒着算
// A/b,余数为r
vector<int> div(vector<int> &A, int b, int &r)
{
r = 0;
vector<int> C;
//因为主函数中是倒着存放的,所以算的时候要倒着算
for(int i = A.size() - 1; i >= 0; i -- )
{
r = r * 10 + A[i];
C.push_back(r / b);
r %= b;
}
//往C里是正着加的,要倒过来,保证最后的答案是倒着存放的
reverse(C.begin(), C.end());
while(C.size() > 1 && C.back() == 0) C.pop_back();
return C;
}