螺旋矩阵

其他 C++ 公开

#include <iostream>
using namespace std;
long long n,m,z = 1,k = 0;
long long a[27][27];
long long b[407];
int main() {

    cin >> n >> m;
    for(long long i=1;i<=n;i++){
        for(long long j=1;j<=m;j++){
            a[i][j]=z;
            z++;
        }
    }
    long long top=1,left=1,right=m,bottom=n;
    while(left<=right&&top<=bottom){
        for(long long i=top;i<=bottom;i++){
            k++;
            b[k]=a[i][left];
        }
        left++;
        for(long long i=left;i<=right;i++){
            k++;
            b[k]=a[bottom][i];
        }
        bottom--;
        for(long long i=bottom;i>=top;i--){
            k++;
            b[k]=a[i][right];
        }
        right--;
        for(long long i=right;i>=left;i--){
            k++;
            b[k]=a[top][i];
        }
        top++;
    }
    for(long long i=1;i<=k;i++){
        if(i!=k)cout << b[i] << ",";
        else cout << b[i];
    }
    
    return 0;
}