一、高精度加法C=A+B
题目描述:
用字符串存储两个大数a和b,求他们的和并输出(a和b都为正)
具体步骤:
- 输入这两个字符串a和b
- 把字符串倒序存储到容器A和B中
- 容器A和B从低位为到高位逐个相加存入容器C,注意进位,循环
- 最后判断是否还有进位
- 倒序输出A+B的和
题解源码:
#include<iostream>
#include<vector>
using namespace std;
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(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);
for (int i = C.size() - 1; i >= 0; --i) cout << C[i];
}
二、高精度减法C=A-B
题目描述:
用字符串存储两个大数a和b,求他们的差并输出(a和b都为正)
具体步骤:
- 输入这两个字符串a和b
- 把字符串倒序存储到容器A和B中
- 定义一个判断A,B大小的函数cmp
- 容器A和B从低位为到高位逐个相减存入容器C,注意借位,循环
- 消除前导0,如00123,变为123
- 倒序输出C
题解源码:
bool cmp(vector<int>& A, vector<int>& B)//判断A是否大于等于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)//默认 A > 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();//去除前导0
return C;
}
int main()
{
string a, b;
cin >> a >> b;
vector<int> A, B, C;
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)) C = sub(A, B);
else {
C = sub(B, A);
cout << "-";
}
for (int i = C.size() - 1; i >= 0; --i) cout << C[i];
}
三、高精度乘法C=A*b
题目描述:
用字符串存储一个大数a,一个整型b,求他们的乘积并输出(a和b都为正)
具体步骤:
- 输入字符串a和整型b
- 把字符串倒序存储到容器A中
- 容器A从低为到高位逐个乘b存入容器C,注意取余进位,循环
- 去除前导0
- 倒序输出C
题解源码:
vector<int> mul(vector<int>& A, int& b)
{
vector<int> C;
for (int i = 0, t = 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();//去除前导0
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');
vector<int> C = mul(A, b);
for (int i = C.size() - 1; i >= 0; --i) cout << C[i];
}
四、高精度除法C=A/b
题目描述:
用字符串存储一个大数A,一个整型b,求他们的商和余数并输出(A和b都为正)
具体步骤:
- 输入字符串a和整型b
- 把字符串倒序存储到容器A中
- 容器中A从高位为到低位逐个与余数相加存入容器C,注意整除,取余,循环
- 把C进行反转
- 除去前导0
- 倒序输出C和r
题解源码:
vector<int> div(vector<int>& A, int& b, int& r)//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();//去除前导0
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;
vector<int> C = div(A, b, r);
for (int i = C.size() - 1; i >= 0; --i) cout << C[i];
cout << endl << r << endl;
}