2889. 魔方阵

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    while(cin >> n)
    {
        int a[n][n];
        memset(a, 0, sizeof(a));
        a[n - 1][n / 2] = 1;
        int k = 2;
        int x = n - 1, y = n / 2;
        while(k <= n * n)
        {
            if(x == n - 1)
                x = 0;
            else
                x++;
            if(y == 0)
                y = n - 1;
            else
                y--;
            if(a[x][y] == 0)
                a[x][y] = k++;
            else
            {
                if(x == 0)
                    x = n - 1;
                else
                    x--;
                if(y == n - 1)
                    y = 0;
                else
                    y++;
                if(x == 0)
                    x = n - 1;
                else
                    x--;
                a[x][y] = k++;

            }
        }
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
                cout << a[i][j] << " ";
            cout << endl;
        }
    }
    return 0;
}

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int nums[100][100];
int main() {
    int n;
    while (cin >> n) {
        memset(nums, 0, sizeof(nums));
        int x = n;
        int y = n / 2 + 1;
        int v = 1;
        while (v <= n * n) {
            nums[x][y] = v++;
            ++x;
            --y;
            if (x > n) {
                x = 1;
            }
            if (y < 1) {
                y = n;
            }
            if (nums[x][y] != 0) {
                x -= 2;
                y += 1;
                if (x < 1 && y > n) {
                    x = n - 1;
                    y = 1;
                }
            }
        }
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                printf("%d%c", nums[i][j], j < n ? ' ' : '\n');
            }
        }
    }
    return 0;
}

      for(x=1; x<=n*n; x++)
        {
            a[i][j]=x;
            if(i==n-1)
                i=0;
            else
                i++;
            if(j==0)
                j=n-1;
            else
                j--;
            if(a[i][j]!=0){
                if(j==n-1)
                    j=0;
                else
                    j++;
                if(i==1)
                    i=n-1;
                else if(i==0)
                    i=n-2;
                else
                    i-=2;
            }
        }