Ruudukko

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n;
    cin>>n;
    int t[n][n];
    for(int i=0; i<n;i++){
        for(int j=0; j<n;j++){
            if(i>0&&j>0){
                int k[i];
                int v[j];
                for(int x=0; x<i;x++){
                    k[x]=t[x][j];
                }
                for(int y=0; y<j;y++){
                    v[y]=t[i][y];
                }
                sort(k,k+i);
                sort(v,v+j);
                int kmin=1;
                int xk=0;
                int yk=0;
                while(true){
                    if(k[xk]==kmin&&v[yk]==kmin){
                        xk++;
                        yk++;
                    }else if(k[xk]==kmin){
                        xk++;
                    }else if(v[yk]==kmin){
                        yk++;
                    }else{
                        break;
                    }
                    kmin++;
                }
                t[i][j]=kmin;
                if(j==n-1){
                    cout<<kmin;
                }else{
                    cout<<kmin<<" ";
                }
            }else if(i==0){
                t[i][j]= j+1;
                cout<<(j+1)<<" ";
            }else{
                t[i][j]=i+1;
                cout<<"\n"<<(i+1)<<" ";
            }
        }
    }
    
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED