AcWing 756. 蛇形矩阵
原题链接
简单
作者:
寧
,
2021-01-11 20:13:48
,
所有人可见
,
阅读 295
#include <iostream>
using namespace std;
int ans[101][101];
int main(){
int n, m;
cin>>n>>m;
int dx[] = {0,1,0,-1}, dy[] = {1,0,-1,0};
int x = 0, y = 0, d = 0;
for(int i = 1; i <= m*n; ++i){
ans[x][y] = i;
int a = x + dx[d], b = y + dy[d];
if(a < 0 || a >= n || b >= m || b < 0 || ans[a][b]){
d = (d + 1) % 4;
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){
cout<<ans[i][j]<<" ";
}
cout<<endl;
}
return 0;
}