AcWing 756. 蛇形矩阵
原题链接
简单
作者:
牛奶小柒Luke
,
2021-02-09 22:01:56
,
所有人可见
,
阅读 328
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int n,m;
int q[N][N];
int main(){
cin >> n >> m;
int dx[4] = {-1,0,1,0},dy[4] = {0,1,0,-1};
int x = 0,y = 0,d = 1;
for(int i = 1;i <= n * m;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;
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 << q[i][j] << ' ';
}
cout << endl;
}
return 0;
}