1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
| string A, B;
cin >> A >> B;
int len = max(A.length(), B.length());
for (int i = A.length() - 1, j = 1; i >= 0; ++j, --i)
ar[j] = A[i] - '0';
for (int i = B.length() - 1, j = 1; i >= 0; ++j, --i)
br[j] = B[i] - '0';
```
A+B
```cpp
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
#define Maxlen 520
int ar[Maxlen], br[Maxlen], cr[Maxlen];
int main()
{
string A, B;
cin >> A >> B;
int len = max(A.length(), B.length());
for (int i = A.length() - 1, j = 1; i >= 0; ++j, --i)
ar[j] = A[i] - '0';
for (int i = B.length() - 1, j = 1; i >= 0; ++j, --i)
br[j] = B[i] - '0';
for (int i = 1; i <= len; ++i)
{
cr[i] += ar[i] + br[i];
if (cr[i] > 9)
cr[i + 1]++;
cr[i] %= 10;
}
if (cr[len + 1])
len++;
for (int i = len; i >= 1; --i)
cout << cr[i];
cout << endl;
return 0;
}
|
