-
Notifications
You must be signed in to change notification settings - Fork 87
/
1074.c
42 lines (34 loc) · 1.05 KB
/
1074.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
#include <stdio.h>
#include <string.h>
int main()
{
int nBase, nA, nB, nS = 21, base, a, b;
char sBase[21] = {0}, sA[21] = {0}, sB[21] = {0}, sSum[22] = {0};
/* Read base table, number A and B into strings */
scanf("%s %s %s", sBase, sA, sB);
nBase = strlen(sBase);
nA = strlen(sA);
nB = strlen(sB);
for (int i = 0; i < nBase; i++) {
/* Transform corresponding digit to integers */
a = nA <= i ? 0 : sA[nA - i - 1] - '0';
b = nB <= i ? 0 : sB[nB - i - 1] - '0';
base = sBase[nBase - i - 1] == '0' ? 10 : sBase[nBase - i - 1] - '0';
/* Calculate ith digit A + B, temperately store integers here */
sSum[nS - i - 1] += a + b;
sSum[nS - i - 2] += sSum[nS - i - 1] / base; /* carry */
sSum[nS - i - 1] = sSum[nS - i - 1] % base;
}
/* Change to char type */
for (int i = 0; i < 21; i++)
sSum[i] += '0';
/* find the first non-zero bit */
for (int first = 0; first < 21; first++)
if (sSum[first] != 0 && sSum[first] != '0') {
puts(sSum + first);
return 0;
}
/* If A + B = 0, then all bits are zero */
printf("0");
return 0;
}