1 files changed, 60 insertions, 0 deletions
diff --git a/challenge-077/ash/cpp/ch-2.cpp b/challenge-077/ash/cpp/ch-2.cpp
new file mode 100644
index 0000000000..2c7aa19721
--- /dev/null
+++ b/challenge-077/ash/cpp/ch-2.cpp
@@ -0,0 +1,60 @@
+/*
+    Task 2 from
+    https://perlweeklychallenge.org/blog/perl-weekly-challenge-077/
+
+    Comments: https://andrewshitov.com/2020/09/08/lonely-x-the-weekly-challenge-77-task-2/
+
+    Compile as:
+    $ g++ -std=c++17 ch-2.cpp
+
+    Output for the given example of matrix:
+    $ ./a.out 
+    0, 3
+    1, 1
+    2, 3
+*/
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<int> test_move(vector<vector<char>> matrix, vector<int> current, vector<int> shift) {
+    current[0] += shift[0];
+    current[1] += shift[1];
+
+    if (current[0] < 0 || current[0] >= matrix.size() ||
+        current[1] < 0 || current[1] >= matrix[0].size()) {
+            return vector<int>();
+    }
+    else {
+        return current;
+    }
+}
+
+int main() {
+    vector<vector<char>> matrix = {
+        {'O', 'O', 'O', 'X'},
+        {'O', 'X', 'O', 'O'},
+        {'O', 'O', 'O', 'X'}
+    };
+
+    vector<vector<int>> neighbours = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
+
+    for (auto row = 0; row != matrix.size(); row++) {
+        for (auto col = 0; col != matrix[0].size(); col++) {
+            if (matrix[row][col] == 'O') continue;
+
+            bool ok = true;
+            for (auto neighbour : neighbours) {
+                auto move = test_move(matrix, vector<int>{row, col}, neighbour);
+                if (move.empty()) continue;
+                if (matrix[move[0]][move[1]] == 'X') {
+                    ok = false;
+                    break;
+                }
+            }
+            if (ok) cout << row << ", " << col << endl;
+        }
+    }
+}