-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday02b.c
81 lines (66 loc) · 1.71 KB
/
day02b.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
// Licensed under the MIT License.
// Cube Conundrum Part 2
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define BUFFER_SIZE 256
#define DELIMITERS ";, "
#define EXCEPTION_FORMAT "Error: Format.\n"
typedef char* String;
int main(void)
{
char buffer[BUFFER_SIZE];
long sum = 0;
clock_t start = clock();
while (fgets(buffer, sizeof buffer, stdin))
{
char* start = strchr(buffer, ':');
if (!start || !strtok(start, DELIMITERS))
{
fprintf(stderr, EXCEPTION_FORMAT);
return 1;
}
String token;
int r = 0;
int g = 0;
int b = 0;
int lastNumber = 0;
while ((token = strtok(NULL, DELIMITERS)))
{
if (!lastNumber)
{
lastNumber = atoi(token);
continue;
}
switch (token[0])
{
case 'r':
if (lastNumber > r)
{
r = lastNumber;
}
break;
case 'g':
if (lastNumber > g)
{
g = lastNumber;
}
break;
case 'b':
if (lastNumber > b)
{
b = lastNumber;
}
break;
default:
fprintf(stderr, EXCEPTION_FORMAT);
return 1;
}
lastNumber = 0;
}
sum += r * g * b;
}
printf("02b %ld %lf\n", sum, (double)(clock() - start) / CLOCKS_PER_SEC);
return 0;
}