blob: f8c06654e0c846e1ea5b5674991d2b6b996994da (
plain) (
blame)
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
|
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int earliest = 0;
scanf("%d\n", &earliest);
int buses[128] = {0};
int len = 0;
for (;;) {
int n = scanf("%d,", &buses[len]);
if (!n) n = scanf("x,");
if (n < 0) break;
len++;
}
int min = INT_MAX;
int bus = 0;
for (int i = 0; i < len; ++i) {
if (!buses[i]) continue;
int wait = (earliest / buses[i] + 1) * buses[i] - earliest;
if (wait < min) {
min = wait;
bus = buses[i];
}
}
printf("%d\n", bus * min);
}
|