基本算法为：先将1填入第一行中间位置；再依次将2-n方按如下规律填写：//1，填入上个数上一行的右边位置，如果没有上一行则转到最后一行，如果右边没有方格//则转到最左边的方格。2，如果要填的位置上已经有数，则转填到它上一个数的下边方格//3，对于第一行的最后一个数的下一个数应填在该数下边的空格处-basic algorithm : a first Enter the middle of the first line; Another will be followed by 2-n-law filled out as follows : / / 1, the number entered on the right side on his position, if not in his will to the last line, if not right box / / then transferred to the most left while the box. 2, to fill the position of several, in turn, to fill it on a number of subordinate box / / 3, the first trip to the final a few under a few should fill in the blank space of a few top candidate Department