妈妈再也不担心没高精度题解了

#include <bits/stdc++.h>
using namespace std;
string s1,s2;
int a[10001];
int b[10001];
int c[10001];

int main()
{
	cin>>s1>>s2;
	
	int len1=s1.size();
	int len2=s2.size();
	
	for(int i=0;i<len1;++i)	a[i] = s1[len1-i-1]-'0';
	for(int i=0;i<len2;++i)	b[i] = s2[len2-i-1]-'0';
	
	int lenmax = max(len1,len2);
	for(int i=0;i<lenmax;++i)
	{
		c[i] = a[i]+b[i]+c[i];
		if(c[i]>=10)
		{
			c[i]%=10;
			c[i+1]++;
		}
	}
	int t = lenmax;
	while(c[t]==0 and t>0)	t--;
	
	for(int i=t;i>=0;--i)	cout<<c[i];
	
	return 0;

}