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> 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 (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 (A.size()) {
t += A[i] * b;
}
c.push_back(t % 10);
t /= 10;
}
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;
}
原文:https://www.cnblogs.com/tyroHeart/p/11182141.html