Ruudukko

#include <iostream>
#include <vector>
#include <algorithm>
#include <assert.h>
 
inline int& get(int* vals, int n, int x, int y)
{
	return vals[x + y * n];
}
inline void set(int* vals, int n, int x, int y, int val)
{
	vals[x + y * n] = val;
}
 
void fill_to(std::vector<int>& v, int n)
{
	v.resize(n);
	for (int i = 0; i < n; i++)
		v[i] = i + 1;
}
 
int main()
{
	int n;
	std::cin >> n;
 
	int* matrix = new int[n * n];
	// i = y
	// k = x
	for (int i = 0; i < n; i++)
	{
		for (int k = 0; k < n; k++)
		{
			// Find available
			std::vector<int> available;
			fill_to(available, n);
 
			for (int j = 0; j < i; j++)
			{
				available[get(matrix, n, k, j) - 1] = -1;
			}
			
			for (int j = 0; j < k; j++)
			{
				available[get(matrix, n, j, i) - 1] = -1;
			}
			std::remove_if(std::begin(available), std::end(available), [](int v) {return v == -1; });
			
			set(matrix, n, k, i, available[0]);
		}
	}
 
	for (int i = 0; i < n * n; i++)
	{
		int x = i % 4;
		std::cout << matrix[i];
		if (x == 3) std::cout << "\n";
		if (x < 3) std::cout << " ";
	}
 
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer

Test 4

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer

Test 5

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer

Test 6

Verdict: RUNTIME ERROR

munmap_chunk(): invalid pointer