Ratsun reitit

input/code.cpp: In function 'int steps(int, int, int)':
input/code.cpp:46:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <iterator>
using namespace std;
 
int used[100][100];
int d[100][100];
int dx[]={-2,-1,1,2,2,1,-1,-2};
int dy[]={1,2,2,1,-1,-2,-2,-1};
int tarx=0, tary=0;
 
bool ok(int x, int y,int n){
	if (x<0 || y<0 || y>=n || x>=n) return false;
 
	if (used[x][y]==1) return false;
 
	return true;
}
 
int steps(int x, int y,int n){
	queue<pair<int,int>> q;
	d[x][y]=0;
	used[x][y]=1;
	q.push({x , y});
	
	while(!q.empty()){
		int cx=q.front().first;
		int cy=q.front().second;
		q.pop();
 
		for (int i=0; i<8; i++){
			if(ok(cx+dx[i],cy+dy[i],n)){
				x=cx+dx[i];
				y=cy+dy[i];
 
				d[x][y] = d[cx][cy]+1;
				used[x][y]=1;
				q.push({x,y});
			}
		}
 
	}
 
 
}
 
typedef long long ll; 
 
const int mx = 1e5;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
#endif
	int n; cin >> n;
	
	steps(0,0,n);
	for (int i=0; i<n;i++){
		for (int j=0; j<n;j++){
			cout<<to_string(d[i][j])<<" ";
		}
		if (i<n-1){
			cout << endl;
		}
	}
 
}

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