题目:
蛇形填数
时间限制:
3000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
在n*n方陈里填入1,2,...,n*n,要求填成蛇形。例如n=4时方陈为:
10 11 12 1
9 16 13 2
8 15 14 3
7 6 5 4
#include<stdio.h>
#include<string.h>
#define MANX 10
int a[MANX][MANX];
int main()
{
int n,x,y,tot=0;
scanf("%d",&n);
memset(a,0,sizeof(a));
tot=a[x=0][y=n-1]=1;
while(tot<n*n)
{
while(x+1<n&&!a[x+1][y])
a[++x][y]=++tot;
while(y-1>=0&&!a[x][y-1])
a[x][--y]=++tot;
while(x-1>=0&&!a[x-1][y])
a[--x][y]=++tot;
while(y+1<n&&!a[x][y+1])
a[x][++y]=++tot;
}
for(x=0;x<n;x++)
{
for(y=0;y<n;y++)
printf("%3d",a[x][y]);
printf("\n");
}
return 0;
}
模拟代码:
#include<stdio.h>
02.
int
main()
03.
{
04.
int
a,b,c,d,n,sum=1;
05.
int
yi[101][101];
06.
scanf
(
"%d"
,&n);
07.
for
(a=0;a<=(n-1)/2;a++)
08.
{
09.
for
(b=a;b<=n-a-1;b++)
10.
yi[b][n-a-1]=sum++;
11.
for
(b=n-2-a;b>=a;b--)
12.
yi[n-a-1][b]=sum++;
13.
for
(b=n-a-2;b>=a;b--)
14.
yi[b][a]=sum++;
15.
for
(b=a+1;b<n-a-1;b++)
16.
yi[a][b]=sum++;
17.
}
18.
for
(c=0;c<n;c++)
19.
{
20.
for
(d=0;d<n;d++)
21.
printf
(
"%d "
,yi[c][d]);
22.
printf
(
"\n"
);
23.
}
24.
}