大整数加法

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long int ll;
const int mod = 1e9;
void BigNumAdd(string &num, string stradd)
{
	int c = 0;
	if (num.length() < stradd.length())
	{
		swap(num, stradd);
	}
	int len = num.length();
	string temp(num.length() - stradd.length(), '0');
	stradd = temp + stradd;
	for (int i = len - 1; i >= 0; i--)
	{
		int temp = (num[i] - '0') + (stradd[i] - '0') + c;
		num[i] = temp % 10 + '0';
		c = temp / 10;
	}
	if (c != 0)
	{
		num.insert(0, string(1, c + '0'));
	}
}
	int main()
{
		string a, b;
		cin >> a >> b;
		BigNumAdd(a, b);
		cout << a << endl;
		return 0;

}