A49856.矩阵旋转 题解

#include <bits/stdc++.h>
using namespace std;
int a[1005][1005];
int b[1005][1005];
int main(){
    int n;
    cin>>n;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            cin>>a[i][j];
        }
    }
    for (int i=1;i<=n;i++){
        b[1][i]=a[n-i+1][1];//上
        b[i][1]=a[n][i];//左
        b[n][i]=a[n-i+1][n];//下
        b[i][n]=a[1][i];//右
    }
    for (int i=2;i<n;i++){
        for (int j=2;j<n;j++){
            b[i][j]=a[i][j];//中间
        }
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            cout<<b[i][j]<<' ';
        }
        cout<<endl;
    }
    return 0;
}