Description: The array is 1, 2, 3 with natural numbers. N2 fills the positions of each element of the n order matrix, making the sum of the elements of each row, the sum of the elements of each row and the main diagonal elements equal. An odd order magic array is an algorithm that sets the number of natural numbers from the last line of the middle of the matrix and always rows to the right lower corner (that is, the next of Aij is Ai+1, j+1). But in the following four situations, it should be modified row number method.
(1) when row is finished (i.e. j=n+1), the first column is transferred.
(2) row row (i.e. i=n+1), then transfer to the first row.
(3) for An, the next n is always An, n-1;
(4) if Aij has been discharged into a natural number, then row Ai 1, j 2.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 奇数阶魔阵问题 | 0 | 2018-04-09
|
| 奇数阶魔阵问题\bin | 0 | 2016-12-14
|
| 奇数阶魔阵问题\bin\Debug | 0 | 2016-12-14
|
| 奇数阶魔阵问题\bin\Debug\奇数阶魔阵问题.exe | 30906 | 2016-12-14
|
| 奇数阶魔阵问题\main.c | 1861 | 2016-12-14
|
| 奇数阶魔阵问题\obj | 0 | 2016-12-14
|
| 奇数阶魔阵问题\obj\Debug | 0 | 2016-12-14
|
| 奇数阶魔阵问题\obj\Debug\main.o | 3569 | 2016-12-14
|
| 奇数阶魔阵问题\奇数阶魔阵问题.cbp | 1152 | 2016-12-14
|
| 奇数阶魔阵问题\奇数阶魔阵问题.cbp.save-failed | 1152 | 2016-12-14
|
| 奇数阶魔阵问题\奇数阶魔阵问题.depend | 153 | 2016-12-14
|
| 奇数阶魔阵问题\奇数阶魔阵问题.layout | 356 | 2018-04-09 |
Download