Ruudukko

#include <bits/stdc++.h>

using namespace std;

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

	unsigned char table[n][n];
	for(int i = 0; i < n; i++) {
		table[0][i] = i + 1;
		table[n - 1][i] = n - i;
	}
	for(int i = 0; i < n; i++) {
		table[i][0] = i + 1;
		table[i][n - 1] = n - i;
	}

	int highest = n * 2;
	char used[highest];
	for(int i = 1; i < n - 1; i++) {
	for(int j = 1; j < n - 1; j++) {
		for(int l = 0; l < highest; l++) used[l] = 0;
		for(int l = j - 1; l >= 0; l--) 
			used[table[i][l] - 1] = 1;
		for(int l = i - 1; l >= 0; l--) 
			used[table[l][j] - 1] = 1;

		int lowest = 999999;
		for(int l = 1; l <= highest; l++) {
			if((lowest > l) && (!used[l - 1])) lowest = l;
		}
		table[i][j] = lowest;
	}
	}

	for(int i = 0; i < n; i++) {
	for(int j = 0; j < n - 1; j++) {
		printf("%d ", table[i][j]);
	}
		printf("%d", table[i][n - 1]);
		printf("\n");
	}

	return 0;
}

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