大数加乘

#include <bits/stdc++.h> //大数相加
using namespace std;

int main()
{
    string a, b, res;
    cin >> a >> b;
    int i, k, inc, lena, lenb, temp;
    lena = a.length(); lenb = b.length();
    for (i = lena - 1, k = lenb - 1, inc = 0; i >= 0 || k >= 0; --i, --k)
    {
        temp = inc;
        if (i >= 0)
        {
        temp += a[i] - '0';
        }
        if (k >= 0)
        {
            temp += b[k] - '0';
        }
        res += temp % 10 + '0';
        inc = temp / 10;
    }
    if (inc)
    {
    res += inc + '0';
    }
    reverse(begin(res), end(res));
    cout << res << endl;
    return 0;
}

#include<bits/stdc++.h> //大数相乘
using namespace std;

string strAdd(string a, string b, int shift)
{
    int i, j, inc, temp;
    string res;
    while (shift-- > 0)
    {
        b = '0' + b;
    }

    temp = inc = 0;
    int lena = a.length();
    int lenb = b.length();

    for (i = j = 0; i < lena || j < lenb; )
    {
	temp = inc;
	if (i < lena)
	{
        	temp += a[i] - '0';
		++i;
	}
	if (j < lenb)
	{
		temp += b[j] - '0';
		++j;
	}      
	inc = temp / 10;
	res += temp % 10 + '0';
    }
    if (inc)
        res += inc + '0';
    return res;
}

string strMulti(string a, string b)
{
    string res = "0";
    int i, j, lena, lenb, nTemp, inc;
    lena = a.length(), lenb = b.length();
    
    reverse(begin(a), end(a));
    reverse(begin(b), end(b));
    
    for (i = 0; i < lena; ++i)
    {
       	nTemp = inc = 0;
        string strTemp = "";
        for (j = 0; j < lenb; ++j)
        {
            nTemp = (a[i] - '0') * (b[j] - '0') + inc;
            inc = nTemp / 10;
            strTemp += nTemp % 10 + '0';
        }
	if (inc > 0)
	{
		strTemp += inc + '0';
	}
       res = strAdd(res, strTemp, i);
    }
    reverse(begin(res), end(res));
    bool flag = true;
    string finalRes;
    for (char c : res)
    {
	if (c == '0' && flag)
	{
		continue;
	}
	else 
	{
		flag = false;
	}
	finalRes += c;
    }
    return finalRes;
}

int main()
{
    string a, b;
    cin >> a >> b;
    cout << strMulti(a, b) << endl;
    return 0;
}