PAT 甲级 1105 Spiral Matrix (25分)

AC【螺旋矩阵】三部曲：1、[ 找到 m、n ] 　　 2、[ 开二维数组填充矩阵 ]　　 3、[ 输出矩阵 ]

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

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

int G[10000][10000];

int main()
{
    int N, m, n, x = 10000 ; cin >> N; //输入第一行
    
    int matrix[N+1];
    for(int i = 0; i < N; i++) cin >> matrix[i];//输入第二行
    
    for(int i = 1; i <= N; i++)//找出[m n]  
    {//[m × n must be equal to N; m≥n; and m?n is the minimum of all the possible values.]
        for(int j = 1; j <= N; j++)
        {
            if(i * j == N && i >= j)
            {
                if( (i - j) < x && (i - j) >= 0) 
                {
                    x = (i - j); m = i; n = j;
                }
            }
        }
    }
    sort(matrix, matrix + N, cmp);//递减排序
    
    int num = 0, round = 0;
    while(num < N)
    {
        for(int i = round; i < n - round && num < N; i++) G[round][i] = matrix[num++];
        
        for(int i = round + 1; i < m - round && num < N; i++) G[i][n-round-1] = matrix[num++];
        
        for(int i = n-round-2; i >= round && num < N; i--) G[m-round-1][i] = matrix[num++];
        
        for(int i = m-round-2; i >= round + 1 && num < N; i--) G[i][round] = matrix[num++];
        
        round++;
    }
    
    for(int i = 0; i < m; i++) 
    {
        for(int j = 0; j < n; j++) 
        {
            cout << G[i][j];
            if(j != n-1) cout << " ";
        }
        if(i != m-1) cout << endl;
    }
    return 0;
}

 

"只要你不停止，走慢一点没关系"