AcWing 756. 蛇形矩阵
原题链接
简单
作者:
小黎Wing
,
2021-01-30 10:54:05
,
所有人可见
,
阅读 2
#include <iostream>
#include <cstring>
using namespace std;
int n,m;
int a[105][105];
int main(){
cin>>n>>m;
memset(a,0,sizeof(a));
int num = 0;
int i=0,j=0;
a[0][0] = ++num;
while(num<n*m){
while(j+1<m&&!a[i][j+1]) a[i][++j] = ++num;
while(i+1<n&&!a[i+1][j]) a[++i][j] = ++num;
while(j-1>=0&&!a[i][j-1]) a[i][--j] = ++num;
while(i-1>=0&&!a[i-1][j]) a[--i][j] = ++num;
}
for(i=0;i<n;i++){
for(j=0;j<m;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}