Ruudukko

#include<bits/stdc++.h>
using namespace std;
 
int main() {
	int n;
	cin >> n;
	int l[n][n];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i == 0) {
				l[i][j] = j+1;
			} else if (j == 0) {
				l[i][j] = l[i-1][j] + 1;
			} else {
				vector<int> s;
				vector<int>::iterator it;
				for (int k = 0; k < i; k++) {
					s.push_back(l[k][j]);
				}
				for (int k = 0; k < j; k++) {
					s.push_back(l[i][k]);
				}
				
				bool done = false;
				int k = 1;
				while (!done) {
					it = find(s.begin(), s.end(), k);
					if (it == s.end()) {
						//cout << k << endl;
						l[i][j] = k;
						done = true;
					}
					k++;
				}
				
			}
			cout << l[i][j] << " ";
		}
		cout << endl;
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED