3
7 8 1 6 9 2 5 4 3
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
using
namespace std;
int a[110][110];
int main(int argc, char* argv[])
{
int
n,i,j,num=0;
scanf("%d",&n);
memset(a,0,sizeof(a));
i=0;
j=n-1;
a[i][j]=1;
num=1;
while(num<n*n)
{
while(j+1<n&&a[i][j+1]==0)
{a[i][++j]=++num;}
while(i+1<n&&a[i+1][j]==0)
{a[++i][j]=++num;}
while(j-1>=0&&a[i][j-1]==0)
{a[i][--j]=++num;}
while(i-1>=0&&a[i-1][j]==0)
{a[--i][j]=++num;}
}
for(i=0;i<n;++i)
{
for(j=0;j<n;++j)
{
printf("%d
",a[i][j]);
}
printf("\n");
}
return 0;
}
原文:http://www.cnblogs.com/52Cyan/p/3671962.html