#include <stdio.h>
int get_min(int x, int y)
{
return x>y?y:x;
}
int next(int x, int y, int n)
{
int i;
int sum = 0, temp=n;
int cir = get_min(get_min(x, y), get_min(n-x-1, n-y-1));
for (i=1; i<=cir; ++i){
sum += n-1;
n -= 2;
}
sum *= 4;
n=temp;
if (x<=y){
sum += x-cir + y+1-cir;
}else{
if (y == cir){
sum += ((n-2*cir -1)*3 + n-x -1*cir);
}else{
sum += (n-2*cir-1)*4/2+1 + x-y;
}
}
return sum;
}
int main()
{
int i,j,n;
scanf("%d", &n);
for (i=0; i<n; ++i){
for (j=0; j<n; ++j){
printf("%2d ",next(i, j, n));
}
printf("\n");
}
return 0;
}
执行结果:
5
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
转圈数组的一种新的实现
最新推荐文章于 2022-08-30 16:59:57 发布