1 条题解

  • -1
    @ 2026-6-2 18:55:39
    #include <cstdio>
    #include <iostream>
    using namespace std;
    const int maxn = 1005;
    int G[maxn][maxn];
    int main () {
        freopen("judge.in", "r", stdin);
        freopen("judge.out", "w", stdout);
        int n;
        cin >> n;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) { 
                cin >> G[i][j]; 
            }
        }
        bool flag = true;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                if (i == j && G[i][j] == 1) {
                    flag = false;
                }
            }
        }
        if (flag) {
            cout << "Yes" << endl; 
        } else {
            cout << "No" << endl;
        }
        return 0;
    }
    
    
    
    
  • 1

信息

ID
431
时间
1000ms
内存
256MiB
难度
7
标签
(无)
递交数
217
已通过
53
上传者