高精度乘法
#include<bits/stdc++.h>
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(1);
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.back() == 0 && C.size() > 1)
C.pop_back();
return C;
}
int main(){
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> sum;
sum.push_back(0);
for(int i=A.size()-1;i>=0;i--){
vector<int> C{B};
C=mul(C,A[i]);
sum=mul(sum,10);
sum=add(sum,C);
}
for(int i=sum.size()-1;i>=0;i--){
cout<<sum[i];
}
return 0;
}
高精度加法
#include<bits/stdc++.h>
using namespace std;
string s,n;
int d,c[505],j;
int main(){
cin>>s>>n;
reverse(s.begin(),s.end());
reverse(n.begin(),n.end());
if(s.size()<n.size()){
j=n.size()-s.size();
for(int i=1;i<=j;i++){
s+="0";
}
}else{
j=s.size()-n.size();
for(int i=1;i<=j;i++){
n+="0";
}
}
for(int i=0;i<s.size();i++){
c[i]=(s[i]-'0'+d+(n[i]-'0'))%10;
d=(s[i]-'0'+d+(n[i]-'0'))/10;
}
if(d){
cout<<"1";
}
for(int i=s.size()-1;i>=0;i--){
cout<<c[i];
}
return 0;
}
高精度减法
#include<bits/stdc++.h>
using namespace std;
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];
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;
}
int main()
{
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;
if(cmp(A, B))
{
C = sub(A, B);
}
else
{
cout << "-";
C = sub(B, A);
}
for(int i = C.size() - 1; i >= 0; i--)
cout << C[i];
return 0;
}
【提高】高精度除单精度
#include<bits/stdc++.h>
using namespace std;
vector<int> div(vector<int> &A, int b, int &r)
{
vector<int> C;
int t = 0;
r = 0;
for(int i = A.size() - 1; i >= 0; i --)
{
t = r * 10 + A[i];
C.push_back(t / b);
r = t % b;
}
reverse(C.begin(), C.end());
while(C.back() == 0 && C.size() > 1)
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;
vector<int> C = div(A, b, r);
for(int i = C.size() - 1; i >= 0; i--)
cout << C[i];
//cout << endl << r;
return 0;
}