diff options
| author | Sebastiano Tronto <sebastiano@tronto.net> | 2024-12-15 09:14:09 +0100 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano@tronto.net> | 2024-12-15 09:14:09 +0100 |
| commit | 9ecea0012b98f42debd536dc863b4ef2501eb859 (patch) | |
| tree | 300c71eb7e7c2c5c749eb3cc0b35a955d32385f2 /2024/04 | |
| parent | e2a90aab7febe9ca73661d17a26fcb0dd10a68a7 (diff) | |
| download | aoc-9ecea0012b98f42debd536dc863b4ef2501eb859.tar.gz aoc-9ecea0012b98f42debd536dc863b4ef2501eb859.zip | |
fixed old code for non-square maps
Diffstat (limited to '2024/04')
| -rw-r--r-- | 2024/04/day04a.cpp | 4 | ||||
| -rw-r--r-- | 2024/04/day04b.cpp | 4 |
2 files changed, 4 insertions, 4 deletions
diff --git a/2024/04/day04a.cpp b/2024/04/day04a.cpp index 887ebef..d108dec 100644 --- a/2024/04/day04a.cpp +++ b/2024/04/day04a.cpp | |||
| @@ -49,7 +49,7 @@ public: | |||
| 49 | cells = new char[M * N]; | 49 | cells = new char[M * N]; |
| 50 | for (int i = 0; i < N; i++) | 50 | for (int i = 0; i < N; i++) |
| 51 | for (int j = 0; j < M; j++) | 51 | for (int j = 0; j < M; j++) |
| 52 | cells[N*i + j] = j < (int)lines[i].size() ? | 52 | cells[M*i + j] = j < (int)lines[i].size() ? |
| 53 | lines[i][j] : out_of_bound; | 53 | lines[i][j] : out_of_bound; |
| 54 | } | 54 | } |
| 55 | 55 | ||
| @@ -73,7 +73,7 @@ private: | |||
| 73 | auto [i, j] = p; | 73 | auto [i, j] = p; |
| 74 | if (i >= N || i < 0 || j >= M || j < 0) | 74 | if (i >= N || i < 0 || j >= M || j < 0) |
| 75 | return out_of_bound; | 75 | return out_of_bound; |
| 76 | return cells[N*i + j]; | 76 | return cells[M*i + j]; |
| 77 | } | 77 | } |
| 78 | }; | 78 | }; |
| 79 | 79 | ||
diff --git a/2024/04/day04b.cpp b/2024/04/day04b.cpp index 3d338d8..6e8a950 100644 --- a/2024/04/day04b.cpp +++ b/2024/04/day04b.cpp | |||
| @@ -49,7 +49,7 @@ public: | |||
| 49 | cells = new char[M * N]; | 49 | cells = new char[M * N]; |
| 50 | for (int i = 0; i < N; i++) | 50 | for (int i = 0; i < N; i++) |
| 51 | for (int j = 0; j < M; j++) | 51 | for (int j = 0; j < M; j++) |
| 52 | cells[N*i + j] = j < (int)lines[i].size() ? | 52 | cells[M*i + j] = j < (int)lines[i].size() ? |
| 53 | lines[i][j] : out_of_bound; | 53 | lines[i][j] : out_of_bound; |
| 54 | } | 54 | } |
| 55 | 55 | ||
| @@ -73,7 +73,7 @@ private: | |||
| 73 | auto [i, j] = p; | 73 | auto [i, j] = p; |
| 74 | if (i >= N || i < 0 || j >= M || j < 0) | 74 | if (i >= N || i < 0 || j >= M || j < 0) |
| 75 | return out_of_bound; | 75 | return out_of_bound; |
| 76 | return cells[N*i + j]; | 76 | return cells[M*i + j]; |
| 77 | } | 77 | } |
| 78 | }; | 78 | }; |
| 79 | 79 | ||