Ratsun reitit

input/code.cpp: In function 'int solve(int, int, int)':
input/code.cpp:76:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

/**
 * Datatähti 2021 alku
 * Ratsun reitit/Horse routes
 * @author TRS
 */
//Include
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <list>
#include <queue>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <regex>
//Definitions
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define mt make_tuple
//Constants
#define infinity 0x3f3f3f3f
#define linfinity 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
const int MX = 101;
int chessboard[MX][MX];
int n;
struct square {
	int row;
	int column;
	int distance;
	square() {}
	square(int row0, int column0, int distance0) {
		row = row0;
		column = column0;
		distance = distance0;
	}
};
bool valid(int n, int row, int column) {
	if (row < 1 || column < 1 || row > n || column > n) {
		return false;
	}
	return true;
}
int solve(int n, int targetPositionR, int targetPositionC) {
	int moveR[] = {-2, -2, -1, -1, 1, 1, 2, 2};
	int moveC[] = {-1, 1, -2, 2, -2, 2, -1, 1};
	queue<square> q;
	q.push(square(1, 1, 0));
	square square0;
	bool visited[n + 1][n + 1];
	memset(&visited, false, sizeof(visited));
	visited[1][1] = true;
	int r, c;
	while (!q.empty()) {
		square0 = q.front();
		q.pop();
		if (square0.row == targetPositionR && square0.column == targetPositionC) {
			return square0.distance;
		}
		for (int i = 0; i < 8; i++) {
			r = square0.row + moveR[i];
			c = square0.column + moveC[i];
			if (valid(n, r, c) && !visited[r][c]) {
				visited[r][c] = true;
				q.push(square(r, c, square0.distance + 1));
			}
		}
	}
}
void fillChessboard(int n) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= i; j++) {
			int value = solve(n, i, j);
			chessboard[i][j] = value;
			chessboard[j][i] = value;
		}
	}
}
void printChessboard(int n) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cout<<chessboard[i][j]<<" ";
		}
		cout<<"\n";
	}
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	fillChessboard(n);
	printChessboard(n);
	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED