Ruudukko

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

int n;

int gind(int y, int x) {
    return n*y+x;
}

bool ok(vector<int> v) {
    set<int> s;
    for (int i = 0; i < n; ++i) {
        int csum = 0;
        int osum = 0;
        for (int j = 0; j < n; ++j) {
            csum += v[gind(i, j)];
            osum += v[gind(j, i)];
        }
        if (s.find(csum) != s.end()) return false;
        s.insert(csum);
        if (s.find(osum) != s.end()) return false;
        s.insert(osum);
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    if (n <= 3) {
        cout << "QAQ\n";
        return 0;
    }
    vector<int> v;
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < n; ++j) {
            v.push_back(i);
        }
    }
    while (!ok(v)) {
        random_shuffle(v.begin(), v.end());
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << v[gind(i, j)] << " ";
        }
        cout << "\n";
    }
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED