PTA 乙级 1050 螺旋矩阵

代码实现：

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int cmp(const void *a, const void *b)
{
	return *(int*)a > *(int*)b ? -1 : 1;
}

int main()
{
	int N, *a, m, n, temp;

	scanf("%d", &N);
	a = (int*)malloc(sizeof(int)*N);
	for (int i = 0; i < N; i++)scanf("%d", &a[i]);
	qsort(a, N, sizeof(int), cmp);
	m = sqrt(N);
	if (m*m == N)n = m;
	else
	{
		int min = 10000;
		for (m = sqrt(N); m <= N; m++)
		{
			n = N / m;
			if (m > n&&m*n == N && min > m - n)min = m - n;
		}
		for (m = sqrt(N); m <= N; m++)
		{
			n = N / m;
			if (m > n&&m*n == N && m - n == min)break;
		}
	}

	int **b = (int**)malloc(sizeof(int*)*m), cnt = 0, count = 0;
	for (int i = 0; i < m; i++)b[i] = (int*)malloc(sizeof(int)*n);
	for (cnt = 0; 1; cnt++)
	{
		for (int i = cnt; i < n - cnt; i++)
		{
			b[cnt][i] = a[count++];
			if (count == N)break;
		}
		if (count == N)break;
		for (int i = cnt + 1; i < m - cnt; i++)
		{
			b[i][n - cnt - 1] = a[count++];
			if (count == N)break;
		}
		if (count == N)break;
		for (int i = n - cnt - 2; i >= cnt; i--)
		{
			b[m - cnt - 1][i] = a[count++];
			if (count == N)break;
		}
		if (count == N)break;
		for (int i = m - cnt - 2; i >= cnt + 1; i--)
		{
			b[i][cnt] = a[count++];
			if (count == N)break;
		}
		if (count == N)break;
	}
	for(int i=0;i<m;i++)
		for (int j = 0; j < n; j++)
		{
			printf("%d", b[i][j]);
			if (j != n - 1)printf(" ");
			else printf("\n");
		}

	return 0;
}