同位大整数加法算法

位数相同的大整数加法算法。

                                    仅供有需要的人以参考，如有错误请纠正我

#include<iostream>using namespace std;int main(){    const unsigned NUM = 4;     //3*4位大整数    unsigned int a1[NUM] = { 198, 672, 534, 179 };    unsigned int a2[NUM] = { 111, 328, 111, 111 };    unsigned int sum[NUM + 1] = {0};    for (int i = 0; i < NUM; i++)    {        if ((a1[i] + a2[i]) < 1000)            sum[i] += a1[i] + a2[i];        else if ((a1[i] + a2[i]) == 1000)        {            sum[i] = { 000 };            sum[i + 1] += 1;        }        else if ((a1[i] + a2[i]) > 1000)        {            sum[i] = (a1[i] + a2[i]) % 1000;            sum[i + 1] += 1;        }    }    for (int i = NUM; i >= 0; i--)    {        if (sum[i] == 0)            cout << "00";        cout << sum[i] << " ";    }    cout << endl;    return 0;}