-
Notifications
You must be signed in to change notification settings - Fork 0
/
part2.c
68 lines (56 loc) · 1.79 KB
/
part2.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
#include <stdio.h>
#include <string.h>
// solution time: 01:47.90
#define SIZE 100
#define STEPS 100
int main() {
bool grid[SIZE][SIZE];
bool new_grid[SIZE][SIZE];
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
FILE *file = fopen("input.in", "r");
char temp;
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
fscanf(file, "%c\n", &temp);
grid[i][j] = (temp == '#');
}
}
fclose(file);
// Set the four corners to "on"
grid[0][0] = grid[0][SIZE-1] = grid[SIZE-1][0] = grid[SIZE-1][SIZE-1] = true;
for (int step = 0; step < STEPS; step++) {
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
int count = 0;
for (int k = 0; k < 8; k++) {
int nx = i + dx[k];
int ny = j + dy[k];
if (nx >= 0 && nx < SIZE && ny >= 0 && ny < SIZE && grid[nx][ny]) {
count++;
}
}
if (grid[i][j] && (count == 2 || count == 3)) {
new_grid[i][j] = true;
} else if (!grid[i][j] && count == 3) {
new_grid[i][j] = true;
} else {
new_grid[i][j] = false;
}
}
}
// Set the four corners to "on"
new_grid[0][0] = new_grid[0][SIZE-1] = new_grid[SIZE-1][0] = new_grid[SIZE-1][SIZE-1] = true;
memcpy(grid, new_grid, sizeof(grid));
}
int count = 0;
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
if (grid[i][j]) {
count++;
}
}
}
printf("%d\n", count);
return 0;
}