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