Skip to content
This repository was archived by the owner on Feb 14, 2020. It is now read-only.

Commit 240146b

Browse files
committed
Solve day 10 part 2
1 parent 2e1dfe0 commit 240146b

File tree

1 file changed

+3
-0
lines changed

1 file changed

+3
-0
lines changed

2018/day10.c

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -18,6 +18,7 @@ int main() {
1818
len++;
1919
}
2020
int minX, minY, maxX, maxY;
21+
int secs = 0;
2122
do {
2223
minX = minY = INT_MAX;
2324
maxX = maxY = INT_MIN;
@@ -29,6 +30,7 @@ int main() {
2930
if (points[i].x > maxX) maxX = points[i].x;
3031
if (points[i].y > maxY) maxY = points[i].y;
3132
}
33+
secs++;
3234
} while (maxY - minY > 9);
3335
for (int y = minY; y <= maxY; ++y) {
3436
for (int x = minX; x <= maxX; ++x) {
@@ -40,4 +42,5 @@ int main() {
4042
}
4143
printf("\n");
4244
}
45+
printf("%d\n", secs);
4346
}

0 commit comments

Comments
 (0)