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 <stdio.h>
#include <stdlib.h>
#include <string.h>
int
chrcmp(void const * a, void const * b)
{
return (*(char const *) a) - *((char const *) b);
}
int
priority(int c)
{
if (c >= 'A' && c <= 'Z')
return 27 + c - 'A';
if (c >= 'a' && c <= 'z')
return 1 + c - 'a';
fprintf(stderr, "Unexpected priority request: %c\n", c);
return -1;
}
int
min(int a, int b)
{
return a < b ? a : b;
}
int
min3(int a, int b, int c)
{
return min(min(a, b), c);
}
int
main()
{
char buf[3][BUFSIZ];
int score = 0;
while (fgets(buf[0], sizeof(buf[0]), stdin)
&& fgets(buf[1], sizeof(buf[1]), stdin)
&& fgets(buf[2], sizeof(buf[2]), stdin))
{
int n, i, j, k;
for (n = 0; n < 3; ++n) {
int len = strlen(buf[n]);
if (len && buf[n][len - 1] == '\n') {
--len;
buf[n][len] = '\0';
}
if (len % 2 == 1)
fprintf(stderr, "Unexpected length: %d\n", len);
qsort(buf[n], len, 1, chrcmp);
}
i = 0; j = 0; k = 0;
while (buf[0][i] != '\0' && buf[1][j] != '\0' && buf[2][k] != '\0') {
int n = min3(buf[0][i], buf[1][j], buf[2][k]);
if (buf[0][i] == n && buf[1][j] == n && buf[2][k] == n)
break;
if (buf[0][i] == n)
++i;
if (buf[1][j] == n)
++j;
if (buf[2][k] == n)
++k;
}
if (buf[0][i] == '\0' || buf[1][j] == '\0' || buf[2][k] == '\0') {
fprintf(stderr, "No match found in %s/%s/%s\n", buf[0], buf[1], buf[2]);
return -1;
}
score += priority(buf[0][i]);
}
printf("Score: %d\n", score);
return 0;
}
|
