Submission #47355091

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long

using namespace std;

int a[20][20];
int cntx[20][20], cnty[20][20], cnt[10];

signed main() {
    for (int i = 1; i <= 9; i++) {
        for (int j = 1; j <= 9; j++) {
            cin >> a[i][j];
            // 判断每一行每一列是否有相同的数字
            cntx[i][a[i][j]]++;
            cnty[j][a[i][j]]++;
            if (cntx[i][a[i][j]] > 1 || cnty[j][a[i][j]] > 1) {
                cout << "No";
                return 0;
            }
        }
    }
    for (int x = 1; x <= 9; x += 3) { // 枚举行的起点
        for (int y = 1; y <= 9; y += 3) { // 枚举列的起点
            memset(cnt, 0, sizeof(cnt));
            // 判断每个小矩阵
            for (int i = x; i < x + 3; i++) {
                for (int j = y; j < y + 3; j++) {
                    cnt[a[i][j]]++;
                    if (cnt[a[i][j]] > 1) {
                        cout << "No";
                        return 0;
                    }
                }
            }
        }
    }
    cout << "Yes";
    return 0;
}

Submission Info

Judge Result