高精度类的加减法、高精度类与低精度的乘法和除法
#include <bits/stdc++.h>
using namespace std;
struct BigN {
vector<int> d{vector<int>(1000, 0)};
int len{0};
};
BigN Change(const char str[])
{
BigN a;
a.len = strlen(str);
for (int i = 0; i < a.len; ++i) {
a.d[i] = str[a.len - 1 - i] - '0';
}
return a;
}
int Compare(const BigN& a, const 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;
else if (a.d[i] < b.d[i])
return -1;
}
return 0;
}
}
void Print(const BigN& a)
{
for (int i = a.len - 1; i >= 0; --i) {
printf("%d", a.d[i]);
}
}
BigN Add(const BigN& a, const BigN& b)
{
BigN ans;
int carry = 0;
for (int i = 0; i < a.len || i < b.len; ++i) {
int tmp = a.d[i] + b.d[i] + carry;
ans.d[ans.len++] = tmp % 10;
carry = tmp / 10;
}
if (carry != 0) {
ans.d[ans.len++] = carry;
}
return ans;
}
BigN Sub(BigN a, const BigN& b)
{
BigN ans;
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;
}
ans.d[ans.len++] = a.d[i] - b.d[i];
}
while (ans.len - 1 >= 1 && ans.d[ans.len - 1] == 0) {
ans.len--;
}
return ans;
}
BigN Muilt(const BigN& a, int b)
{
BigN ans;
int carry = 0;
for (int i = 0; i < a.len; ++i) {
int tmp = a.d[i] * b + carry;
ans.d[ans.len++] = tmp % 10;
carry = tmp / 10;
}
while (carry != 0) {
ans.d[ans.len++] = carry % 10;
carry /= 10;
}
return ans;
}
BigN Divide(const BigN& a, int b, int& r)
{
BigN ans;
ans.len = a.len, r = 0;
for (int i = a.len - 1; i >= 0; --i) {
r = r * 10 + a.d[i];
if (r < b)
ans.d[i] = 0;
else {
ans.d[i] = r / b;
r %= b;
}
}
while (ans.len > 1 && ans.d[ans.len - 1] == 0) {
ans.len--;
}
return ans;
}
int main()
{
}