#include<stdio.h>
#include<math.h>
int a[39][39];
int main()
{
int t, m, i, j, k = 1, n;
scanf("%d", &n);
m = (n - 1) / 2;
a[0][m] = 1;
for (i = 0, j = m, k = 1; k <= pow(n, 2); k++)
{
if ((i != 0 && j != n - 1))
{
if ((a[i - 1][j + 1] == 0))
{
a[i - 1][j + 1] = k + 1;
i--;
j++;
}
else
{
a[i + 1][j] = k + 1;
i++;
}
}
else
{
if (i == 0 && j != n - 1)
{
if (a[n - 1][j + 1] == 0)
{
a[n - 1][j + 1] = k + 1;
i = n - 1;
j++;
}
else
{
a[i + 1][j] = k + 1;
i++;
}
}
else
{
if (i != 0 && j == n - 1)
{
if (a[i - 1][0] == 0)
{
a[i - 1][0] = k + 1;
i--;
j = 0;
}
else
{
a[i + 1][j] = k + 1;
i++;
}
}
else
{
if (a[n - 1][0] == 0)
{
a[n - 1][0] = k + 1;
i = n - 1;
j = 0;
}
else
{
a[i + 1][j] = k + 1;
i++;
}
}
}
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
printf("%d ", a[i][j]);
}
printf("\n");
}
return 0;
}
洛谷P2615 [NOIP2015 提高组] 神奇的幻方经典解法
最新推荐文章于 2024-07-06 15:05:11 发布