这题太难了（高精度）

#include<bits/stdc++.h>
using namespace std;

int main()
{
	string a, b;
	cin >> a >> b;
	int az = a.size();
	int bz = b.size();
	int abz = max(az, bz) + 1;
	int ar[abz];
	ar[abz - 1] = 0;
	for (int i = 0; i < abz; i++)
	{
		int aa = 0, bb = 0;
		if (i < az)
			aa = a[az - i - 1] - '0';
		if (i < bz)
			bb = b[bz - i - 1] - '0';
		ar[i] = aa + bb;
	}
	for (int i = 0; i < abz; i++)
	{
		if (ar[i] >= 10)
		{
			ar[i + 1] += ar[i] / 10;
			ar[i] %= 10;
		}
	}
	if (ar[abz - 1] == 0) {
		abz--;
	}
	for (int i = abz - 1; i >= 0; i--) {
		cout << ar[i];
	}
	return 0;
}