////////////////////////////////////////////////////////////////// //////**************CHALLENGE: What About Knight? //////****************Author: Petros Simidyan ////***************** #include inline bool isInBound(const int& input) { return input >= 0 && input < 8; } inline int checkLefRight(const int& i) { return isInBound(i + 1) + isInBound(i - 1); } inline void testNorth(const int& row, const int& col, int& output) { if (!isInBound(row + 2)) return; output += checkLefRight(col); } inline void testSouth(const int& row, const int& col, int& output) { if (!isInBound(row -2)) return; output += checkLefRight(col); } inline void testEast(const int& row, const int& col, int& output) { if (!isInBound(col+ 2)) return; output += checkLefRight(row); } inline void testWest(const int& row, const int& col, int& output) { if (!isInBound(col - 2)) return; output += checkLefRight(row); } inline int underAttack(const int& row, const int& col, int output = 0) { testNorth(row, col, output); testSouth(row, col, output); testEast(row, col, output); testWest(row, col, output); return output; } void printSolution() { for (int i = 0; i < 8; i++) { for (int j = 0; j < 8; j++) std::cout << underAttack(i, j) << ' '; std::cout << std::endl; } } int main() { printSolution(); return 0; }