蛇形矩阵

#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
const int N=500;
static int a[N][N];
int main()
{
int n,m;
cin>>n>>m;
int i=1,j=1,sum=1;
a[i][j]=1;
while(n*m>sum)
{
while((j+1)<=m&&!a[i][j+1]) a[i][++j]=++sum;
while((i+1)<=n&&!a[i+1][j]) a[++i][j]=++sum;
while((j-1)>=1&&!a[i][j-1]) a[i][--j]=++sum;
while((i-1)>=1&&!a[i-1][j]) a[--i][j]=++sum;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
}

蛇形矩阵

原文：https://www.cnblogs.com/moche/p/14271071.html