大致题意
一个n , 将1 ~ n个数填入n*n的二维数组中。结果如下图:
简单模拟,但是总是写错,于是就放到了这里
代码如下:
#include <iostream>
#include <string.h>
#include <cstdio>
using namespace std;
int n,x,y,tot,a[100][100];
void turn0()
{
memset(a,0,sizeof(a));
tot = a[x=0][y=0] = 1;
while(tot<n*n){
while(y+1<n && !a[x][y+1])
a[x][++y] = ++tot;
while(x+1<n && !a[x+1][y])
a[++x][y] = ++tot;
while(x-1>=0 && !a[x-1][y])
a[--x][y] = ++tot;
while(y-1>=0 && !a[x][y-1])
a[x][--y] = ++tot;
}
}
void turn1()
{
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;
}
}
void turn2(){
int i1=0,i2=n,j1=0,j2=n;
tot = 1;
int i=0,j=0;
a[i][j]=1;
while(tot < n*n){
while(j+1 < i2 ) a[i][++j] = ++tot;
i2--;
while(i+1 < j2 ) a[++i][j] = ++tot;
j2--;
while(j-1 >= i1 ) a[i][--j] = ++tot;
i1++;
while(i-1 > j1 ) a[--i][j] = ++tot;
j1++;
}
}
void print_a()
{
cout<<"........."<<endl;
for (x=0;x<n;x++)
{
for (y=0;y<n;y++)
printf("%-4d",a[x][y]);
cout<<endl;
}
}
int main()
{
cin>>n;
turn0();
print_a();
turn1();
print_a();
turn2();
print_a();
return 0;
}
/*
input 3
output
.........
1 2 3
8 9 4
7 6 5
.........
7 8 1
6 9 2
5 4 3
.........
1 2 3
8 9 4
7 6 5
*/