PAT (Advanced Level)1105 Spiral Matrix (25分)

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 m rows 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

关键：
1、找m、n：从1开始到N遍历使得m-n最小，并满足其他要求的m、n；
2、获取输出结果：用二位数组存储要输出的结果，并分四次为其赋值，顺序为顺时针，利用变量round来表示当前循环次数，并根据最开始输入的数据个数N决定是否退出最外层循环。

坑点：
1、找m、n：要从1开始一直遍历到N（可以不用考虑特殊情况），而不能为了快只遍历到sqrt（N）
2、内部的四个赋值循环一定要检测数组data中的元素是否已经全部赋值完毕。
3、如果遇到测试点超时，应该是陷入了死循环，自己看看程序哪里没对。

#include<bits/stdc++.h>
using namespace std;

bool cmp(int a,int b){
   
	return a>b;
}

const int maxn = 10000;
int G[maxn][maxn];

int