蛇形矩阵

1.纯手写

#include <bits/stdc++.h>

using namespace std;
const int N=110;
int main()
{
    int m,n,a[N][N],sum=1;
    cin>>n>>m;
    int i,j,k;
    for(k=1; k<=floor(min(n,m)/2); k++)
    {
        for(j=k; j<=m-k+1; j++)
        {
            a[k][j]=sum;
            sum++;
        }
        j--;
        for(i=k+1; i<=n-k+1; i++)
        {
            a[i][j]=sum;
            sum++;
        }
        i--;
        for(j=m-k; j>=k; j--)
        {
            a[i][j]=sum;
            sum++;
        }
        j++;
        for(i=n-k; i>=k+1; i--)
        {
            a[i][j]=sum;
            sum++;
        }
        i++;
    }
    k--;sum--;
    //printf("%d\n",sum);
    if(n*m==sum)
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
                cout<<a[i][j]<<" ";
            printf("\n");
        }
    else
    {
        sum++;
        if(n*m-sum<m-2*k)
        {
            for(j=k+1; j<=m-k; j++)
            {
                a[i][j]=sum;
                sum++;
            }
            j--;
        }

        else if(n*m-sum<m+n-1-k*4)
        {
            for(j=k+1; j<=m-k; j++)
            {
                a[i][j]=sum;
                sum++;
            }
            j--;
            for(i=k+2; i<=n-k; i++)
            {
                a[i][j]=sum;
                sum++;
            }
            i--;
        }
        else if(n*m-sum<2*m+n-6*k-2)
        {
            for(j=k+1; j<=m-k; j++)
            {
                a[i][j]=sum;
                sum++;
            }
            j--;
            for(i=k+2; i<=n-k; i++)
            {
                a[i][j]=sum;
                sum++;
            }
            i--;
            for(j=m-k-1; j>=k+1; j--)
            {
                a[i][j]=sum;
                sum++;
            }
            j++;
        }
        else
        {
            for(j=k+1; j<=m-k; j++)
            {
                a[i][j]=sum;
                sum++;
            }
            j--;
            for(i=k+2; i<=n-k; i++)
            {
                a[i][j]=sum;
                sum++;
            }
            i--;
            for(j=m-k-1; j>=k+1; j--)
            {
                a[i][j]=sum;
                sum++;
            }
            j++;
            for(i=n-k-1; i>=k+3; i--)
            {
                a[i][j]=sum;
                sum++;
            }
            i++;
        }
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
                cout<<a[i][j]<<" ";
            printf("\n");
        }
    }
    return 0;
}

2.贪吃蛇写法

#include <bits/stdc++.h>

using namespace std;
const int N=110;
int n,m;
int q[N][N];
int main()
{
    cin>>n>>m;
    int dx[]={-1,0,1,0},dy[]={0,1,0,-1};
    int x=0,y=0,d=1;
    for(int i=1;i<=m*n;i++)
    {
        q[x][y]=i;
        int a=x+dx[d],b=y+dy[d];
        if(a<0||a>=n||b<0||b>=m||q[a][b])//越界或者撞墙
        {
            d=(d+1)%4;//顺时针旋转90度
            a=x+dx[d],b=y+dy[d];
        }
        x=a,y=b;
    }
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        j==m-1?printf("%d \n",q[i][j]):printf("%d ",q[i][j]);
    return 0;
}