-
Notifications
You must be signed in to change notification settings - Fork 23
/
Copy pathp3.c
87 lines (61 loc) · 1.4 KB
/
p3.c
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
int main() {
FILE* f = fopen("p3.in", "r");
char sa[101], sb[101];
fscanf(f, "%100s", sa);
fscanf(f, "%100s", sb);
fclose(f);
int n = strlen(sa), m = strlen(sb);
int* p = (int*)malloc(n * sizeof(int));
for (int i = 0; i < n; ++i) {
p[i] = sa[n - i - 1] - '0';
}
int* q = (int*)malloc(m * sizeof(int));
for (int i = 0; i < m; ++i) {
q[i] = sb[m - i - 1] - '0';
}
int max = (n < m) ? m : n;
int min = (n < m) ? n : m;
int* rez = (int*)malloc((max + 1) * sizeof(int));
int k = 0;
int carry = 0;
while (k < min) {
int suma = p[k] + q[k];
if (carry) {
suma += carry;
carry = 0;
}
rez[k] = suma % 10;
carry = suma / 10;
++k;
}
while (k < n) {
int suma = p[k] + carry;
if (carry) {
suma += carry;
carry = 0;
}
rez[k] = suma % 10;
carry = suma / 10;
++k;
}
while (k < m) {
int suma = q[k] + carry;
if (carry) {
suma += carry;
carry = 0;
}
rez[k] = suma % 10;
carry = suma / 10;
++k;
}
free(q);
free(p);
for (int i = 0; i < k; ++i) {
printf("%c", rez[k - i - 1] + '0');
}
printf("\n");
free(rez);
}