Ruudukko

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    int table[n][n] = {0};
    for(int x = 0; x < n; x++){
        table[0][x] = x+1;
    }
    for(int y = 1; y < n; y++){
        table[y][0] = y+1;
    }

    for(int y = 1; y < n; y++) {
        for (int x = 1; x < n; x++) {
            set<int> nope;
            for(int yy = y; yy >= 0; yy--){
                nope.insert(table[yy][x]);
            }
            for(int xx = x; xx >= 0; xx--){
                nope.insert(table[y][xx]);
            }
            for(int i = 1; i <= n; i++){
                if(nope.find(i) == nope.end()){
                    table[y][x] = i;
                    break;
                }
            }
        }
    }

    for(int y = 0; y < n; y++){
        for(int x = 0; x < n; x++){
            cout << table[y][x] << " ";
        }
        cout << endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER