MOVE J and MOVE L

Problem Statement There is a grid with N × N N×N squares. We denote by ( i , j ) (i,j) the square at the i i-th row from the top and j j-th column from the left. Initially, a piece is placed on ( 1 , 1 ) (1,1). You may repeat the following operation any number of times: Let ( i , j ) (i,j) be the square the piece is currently on. Move the piece to the square whose distance from ( i , j ) (i,j) is exactly M M ​ . Here, we define the distance between square ( i , j ) (i,j) and square ( k , l ) (k,l) as ( i − k ) 2 + ( j − l ) 2 (i−k) 2 +(j−l) 2 ​ . For all squares ( i , j ) (i,j), determine if the piece can reach ( i , j ) (i,j). If it can, find the minimum number of operations required to do so. Constraints 1 ≤ N ≤ 400 1≤N≤400 1 ≤ M ≤ 10 6 1≤M≤10 6 All values in the input are integers. Input The input is given from Standard Input in the following format: N N M M Output Print N N lines. The i i-th line should contain N N integers. If the piece can reach ( i , j ) (i,j), the j j-th integer in the i i-th line should be the minimum number of operations required to do so; otherwise, it should be − 1 −1. 输入数据 1 3 1 输出数据 1 0 1 2 1 2 3 2 3 4 You can move the piece to four adjacent squares. For example, we can move the piece to ( 2 , 2 ) (2,2) with two operations as follows. The piece is now on ( 1 , 1 ) (1,1). The distance between ( 1 , 1 ) (1,1) and ( 1 , 2 ) (1,2) is exactly 1 1 ​ , so move the piece to ( 1 , 2 ) (1,2). The piece is now on ( 1 , 2 ) (1,2). The distance between ( 1 , 2 ) (1,2) and ( 2 , 2 ) (2,2) is exactly 1 1 ​ , so move the piece to ( 2 , 2 ) (2,2). 输入数据 2 10 5 输出数据 2 0 3 2 3 2 3 4 5 4 5 3 4 1 2 3 4 3 4 5 6 2 1 4 3 2 3 4 5 4 5 3 2 3 2 3 4 3 4 5 6 2 3 2 3 4 3 4 5 4 5 3 4 3 4 3 4 5 4 5 6 4 3 4 3 4 5 4 5 6 5 5 4 5 4 5 4 5 6 5 6 4 5 4 5 4 5 6 5 6 7 5 6 5 6 5 6 5 6 7 6 c++完成