AcWing 756. 蛇形矩阵
原题链接
简单
作者:
tobewiner
,
2025-02-25 18:20:42
· 天津
,
所有人可见
,
阅读 1
#include<iostream>
using namespace std;
const int N = 110;
int w[N][N];
int n,m;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int main()
{
cin >> n >> m;
int d = 1;
int x, y = 0;
for(int i = 1;i <= m * n;i++)
{
w[x][y] = i;
int a = x + dx[d], b = y + dy[d];
if(a < 0 || a >= n || b < 0 ||b >= m || w[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 << w[i][j] << " ";
}
cout << endl;
}
return 0;
}