本题要求将给定的N个正整数按非递增的顺序,填入“螺旋矩阵”。所谓“螺旋矩阵”,是指从左上角第1个格子开始,按顺时针螺旋方向填充。要求矩阵的规模为m行n列,满足条件:m*n等于N;m>=n;且m-n取所有可能值中的最小值。
输入格式:
输入在第1行中给出一个正整数N,第2行给出N个待填充的正整数。所有数字不超过104,相邻数字以空格分隔。
输出格式:
输出螺旋矩阵。每行n个数字,共m行。相邻数字以1个空格分隔,行末不得有多余空格。
输入样例:12 37 76 20 98 76 42 53 95 60 81 58 93输出样例:
98 95 93 42 37 81 53 20 76 58 60 76
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
int cmp(const void *b, const void *a);
int main()
{
int N; int m, n;
scanf("%d", &N);
int *tmp = new int[N];
for (int i = (int)sqrt(N); i >=1; i--)
{
if (N%i == 0)
{
n = i;
m = N / n;
break;
}
}
for (int i = 0; i < N; i++)
scanf("%d", &tmp[i]);
qsort(tmp, N, sizeof(int), cmp);
int **number = new int*[m];
for (int i = 0; i < m; i++)
number[i] = new int[n];
for (int i = 0; i < m; i++)
for (int j = 0; j < n; j++)
number[i][j] = 0;
int i = 0;
int j = 0;
int k = 0;
number[i][j] = tmp[k++];
while (k < N)
{
while (j < n - 1 && number[i][j + 1] == 0)
number[i][++j] = tmp[k++];
while (i < m - 1 && number[i + 1][j] == 0)
number[++i][j] = tmp[k++];
while (j > 0 && number[i][j - 1] == 0)
number[i][--j] = tmp[k++];
while (i > 0 && number[i - 1][j] == 0)
number[--i][j] = tmp[k++];
}
for (int i = 0; i < m; i++)
{
int flag = 0;
for (int j = 0; j < n; j++)
{
if (flag == 0)
{
printf("%d", number[i][j]);
flag = 1;
}
else
printf(" %d", number[i][j]);
}
flag = 0;
printf("\n");
}
delete[]tmp;
return 0;
}
int cmp(const void *b, const void *a)
{
return (*(int*)a - *(int*)b);
}