蛇形矩阵

一、题目

二、题解

#include <iostream>
#include <math.h>
#include <algorithm>
#include <cstring>
using namespace std;
#define N 110
int res[N][N];
int n,m;
int main()
{
	cin>>n>>m;
	//01 10 0-1 -10
	int dx[]={0,1,0,-1};
	int dy[]={1,0,-1,0};
	for (int k=1,x=0,y=0,d=0;k<=m*n;k++)
	{
		res[x][y]=k;
		int a=x+dx[d];
		int b=y+dy[d];
		if (a<0 || a>=n || b<0 || b>=m || res[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<<res[i][j]<<" ";
		cout<<"\n";
	}

	return 0;
}