高精度的基本运算入门

高精度加单精度

#include <iostream>
#include <string>
using namespace std;
string num;
int x, len;
int a[105];
int main() {
    cin >> num;
    cin >> x;
    len = num.size();
	for (int i = 0; i < len; i++) {
    	a[i] = num[len - 1 - i] - '0';
	}
    a[0] += x;
	for (int i = 0; i < len; i++) {
    	a[i + 1] += a[i] / 10;
    	a[i] %= 10;
	}
    while (a[len]) {
    	a[len + 1] += a[len] / 10;
   	 	a[len] %= 10;
   	 	len++;
	}
    for (int i = len - 1; i >= 0; i--) {
    	cout << a[i];
	}
	cout << endl;
    return 0;
}

高精度加高精度

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string num1, num2;
int a1[105], a2[105], len1, len2;
int main() {
    cin >> num1 >> num2;
    len1 = num1.size();
    for (int i = 0; i < len1; i++) {
        a1[i] = num1[len1 - 1 - i] - '0';
    }
    len2 = num2.size();
    for (int i = 0; i < len2; i++) {
        a2[i] = num2[len2 - 1 - i] - '0';
    }
    len1 = max(len1, len2);
	for (int i = 0; i < len1; i++) {
	    a1[i] += a2[i];
	}
    for (int i = 0; i < len1; i++) {
    	a1[i + 1] += a1[i] / 10;
    	a1[i] %= 10;
	}
    while (a1[len1]) {
   	 	a1[len1 + 1] += a1[len1] / 10;
   	 	a1[len1] %= 10;
    	len1++;
	}
    for (int i = len1 - 1; i >= 0; i--) {
        cout << a1[i];
    }
    cout << endl;
    return 0;
}

高精度减低精度

#include <iostream>
#include <string>
using namespace std;
string num;
int x, len;
int a[105];
int main() {
    cin >> num;
    cin >> x;
    len = num.size();
    for (int i = 0; i < len; i++) {
        a[i] = num[len - 1 - i] - '0';
    }
    a[0] -= x;
    for (int i = 0; i < len; i++) {
    	while (a[i] < 0) {
    		a[i + 1]--;
        	a[i] += 10;
    	}
	}
    while (len > 1 && a[len - 1] == 0) {
    	len--;
	}
    for (int i = len - 1; i >= 0; i--) {
        cout << a[i];
    }
    cout << endl;
    return 0;
}

高精度减高精度

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string num1, num2;
int a1[105], a2[105], len1, len2;
bool sgn;
bool cmp(string a, string b) {
    if (a.size() != b.size()) {
        return a.size() < b.size();
    }
    return a < b;
}
int main() {
    cin >> num1 >> num2;
    if (cmp(num1, num2)) {
    	sgn = true;
    	swap(num1, num2);
	}
    len1 = num1.size();
    for (int i = 0; i < len1; i++) {
        a1[i] = num1[len1 - 1 - i] - '0';
    }
    len2 = num2.size();
    for (int i = 0; i < len2; i++) {
        a2[i] = num2[len2 - 1 - i] - '0';
    }
    for (int i = 0; i < len1; i++) {
    	a1[i] -= a2[i];
	}
    for (int i = 0; i < len1; i++) {
    	while (a1[i] < 0) {
        	a1[i + 1]--;
        	a1[i] += 10;
    	}
	}
    while (len1 > 1 && a1[len1 - 1] == 0) {
    	len1--;
	}
	if (sgn) {
    	cout << "-";
	}
    for (int i = len1 - 1; i >= 0; i--) {
        cout << a1[i];
    }
    cout << endl;
    return 0;
}

高精度乘以单精度

#include <iostream>
#include <string>
using namespace std;
string num;
int x, len;
int a[105];
int main() {
    cin >> num;
    cin >> x;
    len = num.size();
    for (int i = 0; i < len; i++) {
        a[i] = num[len - 1 - i] - '0';
    }
    for (int i = 0; i < len; i++) {
    	a[i] *= x;
	}
    for (int i = 0; i < len; i++) {
    	a[i + 1] += a[i] / 10;
    	a[i] %= 10;
	}
    while (a[len]) {
    	a[len + 1] += a[len] / 10;
    	a[len] %= 10;
    	len++;
	}
    for (int i = len - 1; i >= 0; i--) {
        cout << a[i];
    }
    cout << endl;
    return 0;
}

高精度乘以高精度

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string num1, num2;
int a1[105], a2[105], len1, len2, a[205], len;
int main() {
    cin >> num1 >> num2;
    len1 = num1.size();
    for (int i = 0; i < len1; i++) {
        a1[i] = num1[len1 - 1 - i] - '0';
    }
    len2 = num2.size();
    for (int i = 0; i < len2; i++) {
        a2[i] = num2[len2 - 1 - i] - '0';
    }
    for (int i = 0; i < len1; i++) {
    	for (int j = 0; j < len2; j++) {
        	a[i + j] += a1[i] * a2[j];
    	}
	}
    len = len1 + len2 - 1;
    
    for (int i = 0; i < len; i++) {
        a[i + 1] += a[i] / 10;
        a[i] %= 10;
    }
    while (a[len]) {
        a[len + 1] += a[len] / 10;
        a[len] %= 10;
        len++;
    }
    for (int i = len - 1; i >= 0; i--) {
        cout << a[i];
    }
    cout << endl;
    return 0;
}