aboutsummaryrefslogtreecommitdiff
path: root/2023/05/5a.c
blob: 14b8c7c49d7eaabef497cb70873f90466d6d1584 (plain)
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
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define N 100
#define ISNUM(c) (c >= '0' && c <= '9')
#define MIN(x,y) ((x)<(y)?(x):(y))

int main() {
	char *buf, line[N];
	int64_t i, m, ns, seed[N], next[N], r[3];

	for (ns = 0, buf = fgets(line, N, stdin); *buf; buf++) {
		if (!ISNUM(*buf)) continue;
		next[ns++] = atoll(buf);
		while (ISNUM(*buf)) buf++;
	}


	while ((buf = fgets(line, N, stdin)) != NULL) {
		if (!ISNUM(*buf)) {
			memcpy(seed, next, ns * sizeof(int64_t));
			fgets(line, N, stdin); /* Discard description */
			continue;
		}

		for (i = 0; *buf; buf++) {
			r[i++] = atoll(buf);
			while (ISNUM(*buf)) buf++;
		}

		for (i = 0; i < ns; i++)
			if (seed[i] >= r[1] && seed[i] < r[1] + r[2])
				next[i] = seed[i] + (r[0] - r[1]);
	}

	for (i = 1, m = next[0]; i < ns; i++)
		m = MIN(m, next[i]);

	printf("%" PRId64 "\n", m);
	return 0;
}

Generated with cgit - Back to sebastiano.tronto.net