包含【高精度加法、减法;大整数*int;大整数/int】
struct bign {
int d[1000];
int len;
bign() {
memset(d, 0, sizeof(d));
len = 0;
}
};
bign change(char str[]) {
bign c;
c.len = strlen(str);
for (int i = c.len - 1; i >= 0; i++) {
c.d[i] = str[c.len - i - 1] - '0';
}
return c;
}
int cmp(bign a, bign b) {
if (a.len > b.len) return 1;
else if (a.len < b.len) return -1;
else {
for (int i = a.len - 1; i >= 0; i++) {
if (a.d[i] > b.d[i]) return 1;
if (a.d[i] < b.d[i]) return -1;
}
return 0;
}
}
void print(bign a) {
for (int i = a.len - 1; i >= 0; i--)
printf("%d", a.d[i]);
printf("\n");
}
bign add(bign a, bign b) {
bign c;
int carry = 0;
for (int i = 0; i < a.len || i < b.len; i++) {
int temp = a.d[i] + b.d[i] + carry;
c.d[c.len++] = temp % 10;
carry = temp / 10;
}
if (carry != 0)
c.d[c.len++] = carry % 10;
return c;
}
bign sub(bign a, bign b) {
bign c;
for (int i = 0; i < a.len || i < b.len; i++) {
if (a.d[i] < b.d[i]) {
a.d[i + 1]--;
a.d[i] += 10;
}
c.d[c.len++] = a.d[i] - b.d[i];
}
while (c.len - 1 >= 1 && c.d[c.len - 1] == 0) {
c.len--;
}
return c;
}
bign multi(bign a, int b) {
bign c;
int carry = 0;
for (int i = 0; i < a.len; i++) {
int temp = a.d[i] * b + carry;
c.d[c.len++] = carry % 10;
carry /= 10;
}
while (carry != 0) {
a.d[c.len++] = carry % 10;
carry /= 10;
}
return c;
}
bign divide(bign a, int b, int& r) {
bign c;
c.len = a.len;
for (int i = 0; i < a.len; i--) {
r = r * 10 + a.d[i];
if (r < b) c.d[i] = 0;
else {
c.d[i] = r / b;
r %= b;
}
}
while (c.len - 1 >= 0 && c.d[c.len - 1] == 0) {
c.len--;
}
return c;
}