C++ 实现 N*N 棋盘中指定格子的同行、同列、对角线位置输出

#include \nusing namespace std;\n\nint main() {\n int N, i, j;\n cin >> N >> i >> j;\n // 输出同一行格子位置\n for (int col = 1; col <= N; col++) {\n cout << "(" << i << "," << col << ") ";\n }\n cout << endl;\n // 输出同一列格子位置\n for (int row = 1; row <= N; row++) {\n cout << "(" << row << "," << j << ") ";\n }\n cout << endl;\n // 输出左上到右下对角线格子位置\n int row = i - 1, col = j - 1;\n while (row >= 1 && col >= 1) {\n cout << "(" << row << "," << col << ") ";\n row--;\n col--;\n }\n row = i + 1;\n col = j + 1;\n while (row <= N && col <= N) {\n cout << "(" << row << "," << col << ") ";\n row++;\n col++;\n }\n cout << endl;\n // 输出左下到右上对角线格子位置\n row = i + 1;\n col = j - 1;\n while (row <= N && col >= 1) {\n cout << "(" << row << "," << col << ") ";\n row++;\n col--;\n }\n row = i - 1;\n col = j + 1;\n while (row >= 1 && col <= N) {\n cout << "(" << row << "," << col << ") ";\n row--;\n col++;\n }\n cout << endl;\n return 0;\n}