| Run ID | 作者 | 问题 | 语言 | 测评结果 | 时间 | 内存 | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 86964 | sh25_zhoumy | 同行列对角线的格 | C++ | 通过 | 0 MS | 252 KB | 1189 | 2026-04-10 14:54:07 |
#include <iostream> #include <vector> using namespace std; int main() { int N, i, j; cin >> N >> i >> j; for (int y = 1; y <= N; y++) { cout << "(" << i << "," << y << ")"; if (y != N) cout << " "; } cout << endl; for (int x = 1; x <= N; x++) { cout << "(" << x << "," << j << ")"; if (x != N) cout << " "; } cout << endl; vector<pair<int, int>> diag1; for (int x = 1; x <= N; x++) { int y = x - (i - j); if (y >= 1 && y <= N) { diag1.emplace_back(x, y); } } for (int k = 0; k < diag1.size(); k++) { cout << "(" << diag1[k].first << "," << diag1[k].second << ")"; if (k != diag1.size() - 1) cout << " "; } cout << endl; vector<pair<int, int>> diag2; for (int x = N; x >= 1; x--) { int y = (i + j) - x; if (y >= 1 && y <= N) { diag2.emplace_back(x, y); } } for (int k = 0; k < diag2.size(); k++) { cout << "(" << diag2[k].first << "," << diag2[k].second << ")"; if (k != diag2.size() - 1) cout << " "; } cout << endl; return 0; }