高精度算法

合集 - 数据结构与算法(24)

1.二分2024-07-202.排序2024-07-20

3.高精度算法2024-07-20

4.前缀和2024-07-225.差分2024-07-226.离散化2024-07-237.区间合并2024-07-258.单链表2024-07-259.单调栈、队列2024-07-2510.kmp2024-07-2611.Tire树2024-07-2712.并查集2024-07-2713.加速cin/cout2024-07-2714.堆2024-07-2715.哈希表2024-07-2716.STL2024-07-2817.pta重排链表（一个很清晰的实现，完全模拟链表的实现）2024-09-1718.栈实现递归2024-09-2119.用结构体永久存储下标2024-09-2320.二分查找进阶2024-10-1821.PAT排名汇总2024-10-2122.散列表2024-10-3023.哈希（框架）2024-11-0624.递归树时间复杂度2024-12-06

收起

加法

#include<iostream>
using namespace std;
string s1, s2;
int a[101], b[101],c[101];
void strtoint(string str,int des[]) {
	for (int i = 0; i < str.size(); i++) {
		des[str.size() - i] = str[i] - '0';
}
}

int main() {
	cin >> s1 >> s2;
	strtoint(s1, a);
	strtoint(s2, b);
	int la, lb, lc;
	la = s1.size();
	lb = s2.size();
	lc = max(la, lb) + 1;
	for (int i = 1; i <= lc; i++) {
		c[i] = a[i] + b[i] + c[i];
		c[i + 1] = c[i] / 10;
		c[i] = c[i] % 10;
	}
	while (c[lc] == 0 && lc > 1) lc--;
	for (int i = lc; i >= 1; i--) cout << c[i];


}

减法

#include<iostream>
using namespace std;
string s1, s2;
int a[101], b[101], c[101];
void strtoint(string str, int des[]) {
	for (int i = 0; i < str.size(); i++) {
		des[str.size() - i] = str[i] - '0';
	}
}


int main() {
	cin >> s1 >> s2;
	strtoint(s1, a);
	strtoint(s2, b);
	int la, lb, lc;
	la = s1.size();
	lb = s2.size();
	lc = max(la, lb) + 1;
	for (int i = 1; i <= lc; i++) {
		if (a[i] - b[i] < 0) {
			a[i] += 10;
			a[i + 1]--;
		}
		c[i] = a[i] - b[i];
	}
	while (c[lc] == 0 && lc > 1) lc--;
	for (int i = lc; i >= 1; i--) cout << c[i];
}

乘法

#include<iostream>
#include<string>
using namespace std;
string s1, s2;
int a[100000], b[100000], c[100000];
void strtoint(string str, int des[]) {
	for (int i = 0; i < str.size(); i++) {
		des[str.size() - i] = str[i] - '0';
	}
}

int main() {
	cin >> s1 >> s2;
	strtoint(s1, a);
	strtoint(s2, b);
	int la = s1.size();
	int lb = s2.size();
	int lc = la + lb;
	for (int i = 1; i <= la; i++) {
		for (int j = 1; j <= lb; j++) {
			c[i + j - 1] += a[i] * b[j];
			c[i + j] += c[i + j - 1] / 10;
			c[i + j - 1] %= 10;
		}
	}
	while (c[lc] == 0 && lc > 1) lc--;
	for (int i = lc; i >= 1; i--) cout << c[i];
}

除法

#include<iostream>
using namespace std;
string s1;
long long b;
int tmp;
short a[100000],c[100000];
void strtoint(string str, short des[]) {
	for (int i = 0; i < str.size(); i++) {
		des[i+1] = str[i] - '0';
	}
}

int main() {
	cin >> s1>>b;
	strtoint(s1, a);
	
	int la;
	la= s1.size();
	for (int i = 1; i <= la; i++) {
		c[i] = (tmp * 10 + a[i]) / b;
		tmp = (tmp * 10 + a[i]) % b;
	}
	int lc = 1;
	while (c[lc] == 0) lc++;
	for (int i = lc; i <= la; i++) cout << c[i];

	cout << "余数: " << tmp << endl;
}