螺旋矩阵输出

题目地址  https://www.patest.cn/contests/pat-b-practise/1050

#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int a[10000], b[10000][10000] = { 0 };


/*
12
37 76 20 98 76 42 53 95 60 81 58 93
*/
int main() {
int k, m, n;// m > n





cin >> k;//输入的数据总数
int i, j;
for (i = 0; i < k; i++)
{
cin >> a[i];
}


n = sqrt(k);
//if(n * n != k)
// m = n + 1;
//else
// m = n;
for (i = n; i >= 1; i--)
{
if (k % i == 0)
{
m = k / i;
n = i;
break;
}


}




int maxm = m, minm = 1, maxn = n, minn = 1;


sort(a, a + k);
int p = 1, q = 1;
int d = 1;
for (i = k - 1; i >= 0; i--)
{
if (b[p][q] == 0)//p 行 q列
{
b[p][q] = a[i];
}
else i++;
// n 列 ， m行


if (d == 1) {
if (q != maxn)
q++;
else
{
d = 2;
minm++;
}


}
if (d == 2) {
if (p != maxm)
p++;
else
{
d = 3;
maxn--;
}
}
if (d == 3) {
if (q != minn)
q--;
else
{
d = 4;
maxm--;
}
}
if (d == 4) {
if (p != minm)
p--;
else
{
d = 1;
minn++;
}


}




}


for (i = 1; i <= m; i++)
{
for (j = 1; j <= n; j++)
if (j == n) cout << b[i][j];
else       cout << b[i][j] << " ";


cout << endl;
}


system("pause");
return 0;


}