1105. Spiral Matrix (25)

 

时间限制

150 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

This time your job is to fill a sequence of N positive integers into a spiral matrix in non-increasing order. Aspiral 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; andm-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⁴. 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:

1237 76 20 98 76 42 53 95 60 81 58 93

Sample Output:

98 95 9342 37 8153 20 7658 60 76

#include <stdio.h>  #include <stdlib.h>  #include <math.h>#define MAX 10000int matrix[MAX][MAX];int mask[MAX][MAX];int number[MAX];int cmp(const void *a, const void *b){return *(int*)b - *(int*)a;}int main(){int N;int m, n;int i, j, count;//freopen("d:\\input.txt", "r", stdin);scanf("%d", &N);for (i = 0; i < N; i++){scanf("%d", &number[i]);}qsort(number, N, sizeof(number[0]), cmp);m = N;n = 1;for (i = 1; i <= N; i++){if (N%i == 0 && i >= (N / i)){m = i;n = N / i;break;}}for (i = 0; i < m; i++) //set mask;{for (j = 0; j < n; j++){mask[i][j] = 1;}}i = 0;j = 0;count = 0;while (count < N){while (mask[i][j] != 0)//向右填充{mask[i][j] = 0;matrix[i][j] = number[count++];j++;}j--; // 回退i++;while (mask[i][j] != 0)//向下填充{mask[i][j] = 0;matrix[i][j] = number[count++];i++;}i--; //回退j--;while (mask[i][j] != 0 && j >= 0)//向左填充{mask[i][j] = 0;matrix[i][j] = number[count++];j--;}j++; //回退i--;while (mask[i][j] != 0 && i >= 0)//向上填充{mask[i][j] = 0;matrix[i][j] = number[count++];i--;}i++;//回退j++;}for (i = 0; i < m; i++){printf("%d", matrix[i][0]);for (j = 1; j < n; j++){printf(" %d", matrix[i][j]);}puts("");}return 0;}