-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBig_Integer _Adding.cpp
More file actions
54 lines (39 loc) · 1.36 KB
/
Copy pathBig_Integer _Adding.cpp
File metadata and controls
54 lines (39 loc) · 1.36 KB
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
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <cstdio>
#include <algorithm>
#include <cstring>
#define N 100
using namespace std;
int main (int argc, char *argv [])
{
char firstNumber [N];
char secondNumber [N];
int result [N + 10];
// initialize the array with '0'
memset(firstNumber, '0', sizeof firstNumber);
memset(secondNumber, '0', sizeof secondNumber);
scanf ("%s %s", firstNumber, secondNumber);
int firstNumberLength = strlen (firstNumber);
int secondNumberLength = strlen (secondNumber);
int maximumLength = max (firstNumberLength, secondNumberLength);
reverse(firstNumber, firstNumber + strlen(firstNumber));
reverse(secondNumber, secondNumber + strlen(secondNumber));
// normalize the last end of string character
firstNumber [firstNumberLength] = '0';
secondNumber [secondNumberLength] = '0';
int carry = 0;
int resultLength = 0;
for ( int i = 0; i < maximumLength; i++ ) {
carry = (firstNumber [i] - '0') + (secondNumber [i] - '0') + carry;
result [resultLength++] = carry % 10;
carry /= 10;
}
while ( carry ) {
result [resultLength++] = carry % 10;
carry /= 10;
}
reverse(result, result + resultLength);
for ( int i = 0; i < resultLength; i++ )
printf ("%d", result [i]);
printf ("\n");
return 0;
}