一、加法
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;
}
二.减法
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;
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;
}
三.乘法
高精乘低精
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;
}
四.除法
高精除低精
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()
{
#if 0
string a, b;
cin>>a>>b;
vector<int>x, y;
for(int i=a.size()-1;i>=0;i--) x.push_back(a[i]-'0');
for(int i=b.size()-1;i>=0;i--) y.push_back(b[i]-'0');
vector<int>z = add(x, y);
#endif
#if 0
string a, b;
cin >> a >> b;
vector<int>x, y;
for(int i=a.size()-1;i>=0;i--) x.push_back(a[i]-'0');
for(int i=b.size()-1;i>=0;i--) y.push_back(b[i]-'0');
vector<int>z ;
if(cmp(x, y)) z= del(x, y);
else z=del(y,x);
for(int i=z.size()-1;i>=0;i--) cout<<z[i];
cout<<endl;
#endif
#if 0
string a; int b;
cin >> a >> b;
vector<int>x;
for(int i=a.size()-1;i>=0;i--) x.push_back(a[i]-'0');
vector<int> z=mul(x, b);
for(int i=z.size()-1;i>=0;i--) cout<<z[i];
cout<<endl;
#endif
#if 0
string a; int b;
cin >> a >> b;
vector<int>x;
for(int i=a.size()-1;i>=0;i--) x.push_back(a[i]-'0');
int r=0;
vector<int> z=div(x, b, r);
for(int i=z.size()-1;i>=0;i--) cout<<z[i];
cout<<endl;
cout<<r<<endl;
#endif
return 0;
}