A simple problem in C++ and Haskell.

x.cxx

template <typename T>
bool f(const vector<vector<T>>& matrix) {
	if (matrix.size() == 0) {
		return true;
	}

	size_t m = matrix.size();
	size_t n = matrix[0].size();

	for (int r = 0; r < m; ++r) {
		for (int c = 0; c < n; ++c) {
			if (matrix[r][c] != matrix[m-r-1][n-c-1]) {
				return false;
			}
		}
	}

	return true;
}

X.hs

f :: [[a]] -> Bool
f matrix = flattenedMatrix == (reverse flattenedMatrix)
    where flattenedMatrix = concat matrix

-- Note that concat (defined in the default environment) simply flattens a list of lists into a list.
concat :: [[a]] -> [a]