Ruudukko

#include <iostream>
#include <algorithm>

void set(int* m, int n, int x, int y, int v)
{
    m[x + y * n] = v;
}

int get(int* m, int n, int x, int y)
{
    return m[x + n * y];
}

bool is_left_or_above(int* m, int n, int x, int y, int v)
{
    for(int y_i = 0; y_i < y; y_i++)
    {
        if(get(m, n, x, y_i) == v) 
            return true; 
    }
    for(int x_i = 0; x_i < x; x_i++)
    {
        if(get(m, n, x_i, y) == v) 
            return true; 
    }
    return false;
}

int main()
{
    int n;
    std::cin >> n;

    int* matrix = new int[n * n];
    for(int i = 0; i < n * n; i++)
    {
        matrix[i] = 0;
    }
    for(int y = 0; y < n; y++)
    {
        for(int x = 0; x < n; x++)
        {
            int val = 1;
            
            while(is_left_or_above(matrix, n, x, y, val))
            {
                val++;
            }

            set(matrix, n, x, y, val);
            std::cout << val;
            if(x < n) 
                std::cout << " ";
        } 
        if(y < n)
            std::cout << "\n";
    }

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED