#define n 10
main()
{int i,j,t=n,a[n+1][n+1];
int th(int ,int,int);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=th(i,j,t);
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
printf("%-3d ",a[i][j]);
printf("\n");
}getch();
}
int th(int i,int j,int t)
{int min(int,int);
int k,outcircle,front;
k=min(min(j-1,t-j),min(i-1,t-i));
outcircle=4*k*(t-k);
i-=k;j-=k;t-=2*k;
if(i==1) front=j-1;
else if(i==t) front=3*t-j-2;
else if(j==1) front=4*t-i-3;
else if(j==t) front=t+i-2;
return outcircle+front+1;
}
int min(int x,int y)
{return x>y?y:x;}