主要计算long long(19位)以上的加法
比如:
11111111111111111111(20位)+11111111111111111111(20位)
靠long long是没有用的,需要用到string数组
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
string s1, s2;
int a[250], b[250], c[500];
int len1, len2;
cin >> s1 >> s2;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(c, 0, sizeof(c));
len1 = s1.length();
len2 = s2.length();
for (int i = 0; i < len1; i++)
{
a[i] = s1[len1 - 1 - i] - '0';
}
for (int i = 0; i < len2; i++)
{
b[i] = s2[len2 - 1 - i] - '0';
}
int len = len1 > len2 ? len1 : len2;
for (int i = 0; i < len; i++)
{
c[i] = a[i] + b[i];
}
for (int i = 0; i < len; i++)
{
if (c[i] >= 10)
{
c[i + 1] = c[i + 1] + c[i] / 10;
c[i] %= 10;
}
}
if (c[len] != 0)
{
len++;
}
for (int i = len - 1; i >= 0; i--)
{
cout << c[i];
}
return 0;
}