PTA 乙级 1050 螺旋矩阵 (25分) C++

 

 这题真的是想了老半天，也不太会，看了看别人的，学习学习

#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;
/*用于排序的二维数组*/
int out[10000][100] = { 0 };
/*sort*/
bool cmp(int a, int b) {
    return a > b;
}
int main() {
    int num = 0;
    int n = 0, m = 0;
    /*写入二维数组时的递增变量*/
    int a = 0;
    /*四边形的每个边的层数*/
    int lel = 0;
    cin >> num;
    vector<int> arr(num);
    for (int i = 0; i < num; ++i)cin >> arr[i];
    sort(arr.begin(), arr.end(), cmp);                //输入数据从大到小排序
    for (n = sqrt((double)num); n >= 1; n--) {        //利用平方根寻找符合条件的m和n
        if (num % n == 0) {
            m = num / n;
            break;
        }
    }
    lel = m / 2 + m % 2;                            //长（正）方形边包含最多数字的个数（以最长的边为基准）
    for (int i = 0; i < lel; ++i) {
        for (int j = i; j < n - i && a < num; ++j)out[i][j] = arr[a++];                    //上
        for (int j = i + 1; j < m - i - 1 && a < num; ++j)out[j][n - i - 1] = arr[a++]; //右
        for (int j = n - i - 1; j >= i && a < num; --j)out[m - i - 1][j] = arr[a++];    //下
        for (int j = m - i - 2; j > i && a < num; --j)out[j][i] = arr[a++];                //左
    }
    for (int i = 0; i < m; ++i) {                    //输出
        for (int j = 0; j < n; ++j) {
            if (j == n - 1)cout << out[i][j];
            else cout << out[i][j] << ' ';
        }
        cout << endl;
    }
    return 0;
}

 

 大佬