蛇形矩阵
python
m,n=map(int,input().split())
list=[[0]*n for i in range(m)]
dx=[-1,0,1,0]
dy=[0,1,0,-1]
x,y,d=0,0,0
for i in range(1,n*m+1):
list[x][y]=i
a,b=x+dx[d],y+dy[d]
if a<0 or a>=m or b<0 or b>=n or list[a][b]:
d=(d+1)%4
a,b=x+dx[d],y+dy[d]
x,y=a,b
for i in range(m):
for j in range(n):
print(list[i][j],end=' ')
print()
c++
#include <iostream>
using namespace std;
const int N = 110;
int n, m;
int q[N][N];
int main()
{
cin >> n >> m;
int dx[] = {-1, 0, 1, 0}, dy[] = {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;
}
//by y总