高精度加减法代码(带注释)

加法原题:https://www.luogu.com.cn/problem/P1601

#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
char c1[505], c2[505];
int a1[505], a2[505], r[505];
int main()
{
	cin >> c1 >> c2;
	int len1 = strlen(c1);
	int len2 = strlen(c2);
	for (int i = 0; i < len1; i++)
		a1[len1 - i] = c1[i]-'0';//将字符串倒置，便于我们可以从个位开始计算，例如321，变成123，方便计算。
	for (int i = 0; i < len2; i++)
		a2[len2 - i] = c2[i] - '0';
	int length = max(len1, len2)+1;//若字符串为1234，下标是0，1，2，3，但长度是4，加一是因为可能进位。
	for (int i = 1; i <= length; i++)//最后存到的下标是1.
	{
		r[i] += a1[i] + a2[i];//低位直接相加,记住是要加上从低位进来的值,+=.
		r[i + 1] = r[i] / 10;//若低位相加则进位，高位+1；
		r[i] =r[i]% 10;//低位取余数.
	}
	if (r[length] == 0 && length > 0) length--;
	for (int i = length; i >= 1; i--)
		cout << r[i];
}

减法原题:https://www.luogu.com.cn/problem/P2142

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
char s1[11000], s2[11000], s3[11000];
int a1[11000], a2[11000], a3[11000];
bool compare(char s1[], char s2[])
{
	int len1 = strlen(s1), len2 = strlen(s2);
	if (len1 != len2) return len1 > len2;//长度不相等，则直接判断
	for (int i = 0; i < len1; i++)
	{
		if (s1[i] != s2[i])return s1[i] > s2[i];//依次判断每个数的大小.
	}
	return true;
}
int main()
{
	cin >> s1 >> s2;
	int flag = 0;
	if (!compare(s1, s2))//若s1《s2则返回false，进入if语句块，交换s1，s2记住结果是负数。
	{
		strcpy_s(s3, s1);
		strcpy_s(s1, s2);
		strcpy_s(s2, s3);
		flag = 1;
	}
	int len1 = strlen(s1), len2 = strlen(s2);
	for (int i = 0; i < len1; i++)
		a1[len1 - i] = s1[i] - '0';
	for (int i = 0; i < len2; i++)
		a2[len2 - i] = s2[i] - '0';
	int length = max(len1, len2);//最长也就是不退位。
	for (int i = 1; i <= length; i++)
	{
		if (a1[i] < a2[i])
		{
			a1[i + 1]--;
			a1[i] += 10;
		}
		a3[i] = a1[i] - a2[i];
	}
	while(a3[length] == 0 && length > 1)//可能退了很多位，不止一个前导0.
		length--;
	if (flag)
		cout << "-";
	for (int i = length; i >= 1; i--)
		cout << a3[i];
}