Ratsun reitit

#include <iostream>

using namespace std;

int mins[100][100];
int n;

void haku(int x, int y, int siirrot) {
  if (mins[y][x] != -1) {
    if (siirrot < mins[y][x]) {
      mins[y][x] = siirrot;
    } else {
      // Tähän pisteeseen on päästy pienemmälläkin siirtomäärällä
      return;
    }
  } else {
    mins[y][x] = siirrot;
  }

  /*
              [y-2, x-1][][y-2, x+1]
    [y-1, x-2]          []          [y-1, x+2]
        []        []    []    []        []
    [y+1, x-2]          []          [y+1, x+2]
              [y+2, x-1][][y+2, x+1]
  */

  if (y-2 >= 0) {
    if (x-1 >= 0) haku(x-1, y-2, siirrot+1);
    if (x+1 < n) haku(x+1, y-2, siirrot+1);
  }

  if (y-1 >= 0) {
    if (x-2 >= 0) haku(x-2, y-1, siirrot+1);
    if (x+2 < n) haku(x+2, y-1, siirrot+1);
  }

  if (y+1 < n) {
    if (x-2 >= 0) haku(x-2, y+1, siirrot+1);
    if (x+2 < n) haku(x+2, y+1, siirrot+1);
  }

  if (y+2 < n) {
    if (x-1 >= 0) haku(x-1, y+2, siirrot+1);
    if (x+1 < n) haku(x+1, y+2, siirrot+1);
  }
}

int main() {
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < 100; j++) {
      mins[i][j] = -1;
    }
  }

  cin >> n;

  haku(0, 0, 0);

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cout << mins[i][j] << " ";
    }

    cout << "\n";
  }
}

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