AcWing每日一题--蛇形矩阵

https://www.acwing.com/problem/content/758/

模拟题

#include<iostream>
using namespace std;
const int N=110;
int a[N][N];
int u[]={-1,0,1,0};
int v[]={0,1,0,-1};
int main(void){
    int n,m;
    cin>>n>>m;
    int x=0,y=0,d=1;
    for(int i=1;i<=n*m;i++){
        a[x][y]=i;
        int tx=x+u[d];
        int ty=y+v[d];
        if(tx<0||tx>=n||ty<0||ty>=m||a[tx][ty]){
            d=(d+1)%4;
            tx=x+u[d];
            ty=y+v[d];
        }
        x=tx,y=ty;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cout<<a[i][j]<<" ";      
        }
        cout<<endl;
    }
    return 0;
}