1105 Spiral Matrix（25 分）
This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. A spiral matrix is filled in from the first element at the upper-left corner, then move in a clockwise spiral. The matrix has mrows and n columns, where m and n satisfy the following: m×n must be equal to N; m≥n; and m?n is the minimum of all the possible values.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N. Then the next line contains N positive integers to be filled into the spiral matrix. All the numbers are no more than 10?4??. The numbers in a line are separated by spaces.
Output Specification:
For each test case, output the resulting matrix in m lines, each contains n numbers. There must be exactly 1 space between two adjacent numbers, and no extra space at the end of each line.
Sample Input:
12
37 76 20 98 76 42 53 95 60 81 58 93
Sample Output:
98 95 93
42 37 81
53 20 76
58 60 76题目大意：输入一个数N，并且有N个数，给出一个非递增的螺旋矩阵，m是行，n是列，m*n=N，要求m>=n,并且在所有可能的取值中，m-n的值最小。
//1.首先就需要对N进行因式分解，确定m和n。2.其次就放就可以了。
//N的范围没给。
原文地址：https://www.cnblogs.com/BlueBlueSea/p/9538403.html