#include<stdio.h>
#define N 7
void main(){
    int a[N][N] = {}, i, j, n, m=0;
    printf("%d阶幻方如下:\n", N);
    a[0][(N - 1) / 2] = 1;
    for (n = 2, i = 0, j = (N - 1) / 2; n <= N*N; n++){
        if (i - 1 >= 0 && j + 1 < N){
            if (a[i - 1][j + 1] == 0){
                a[i - 1][j + 1] = n;
                i--;
                j++;
                break;
            }
            else{
                a[i][j + 1] = n;
                j++;
                break;
            }
        }
         if (i - 1 < 0&&j+1<N){
            for (i = N - 1; i >= 0; i--){
                if (a[i][j+1] == 0){
                    a[i][j+1] = n;
                    j++;
                    break;
                }
            }
        }
         if (i - 1 >= 0 && j + 1 >= N){
            for (j = 0; j < N; j++){
                if (a[i-1][j] == 0){
                    a[i-1][j] = n;
                    i--;
                    break;
                }
            }
        }
     if (i == 0 && j == N - 1){
            i++;
            a[i][j] = n;
            break;
        }
    }
    for (i=0;i<N; i++){
        for (j = 0; j < N; j++){
            printf("%4d\t",a[i][j] );
            m++;
            if (m%N == 0)
                printf("\n");
        }
    }
}

你先把所有的break都改成continue

谢谢,已经搞定了,可以看看还有啥改进的么
#include<stdio.h>
#define N 7
void main(){
    int a[N][N] = {0}, i, j, n, m=0;
    printf("%d阶幻方如下:\n", N);
    a[0][(N - 1) / 2] = 1;
    for (n = 2, i = 0, j = (N - 1) / 2; n <= N*N; n++){
        if (i - 1 >= 0 && j + 1 < N){
            if (a[i - 1][j + 1] == 0){
                i--;
                j++;
            }
            else{
                a[i+1][j] = n;
                i++;
            }
        }
        else if (i - 1 < 0&&j+1<N){
                if (a[N-1][j+1] == 0){
                    j++;
                    i = N-1;
                }
                else{
                    i++;
                }
        }
        else if (i - 1 >= 0 && j + 1 >= N){
                if (a[i-1][0] == 0){
                    i--;
                    j = 0;
                }
                else{
                    j = 0;
                }
        }
        else if (i == 0 && j == N - 1){
            i++;
        }
         a[i][j] = n;
    }
    for (i=0;i<N; i++){
        for (j = 0; j < N; j++){
            printf("%4d\t",a[i][j] );
            m++;
            if (m%N == 0)
                printf("\n");
        }
    }
}

#include <stdio.h>
#include <malloc.h>

void output_magic(int n)
{
    int * a, i, j, k;
    if(!(n & 1)) return;
    a = (int *)calloc(n * n, sizeof(int));
    for(i = 1, j = 0, k = n / 2; i <= n * n; i++)
    {
        a[j * n + k] = i;
        j = j ? j - 1 : n - 1;
        k = (k + 1) % n;
        if(a[j * n + k])
            k = k ? k - 1 : n - 1,
            j = (j + 2) % n;
    }
    for(i = 0; i < n; i++, puts(""))
    for(j = 0; j < n; printf("%3d ", a[i * n + j++]));
    free(a);
}

int main()
{
    int n;
    scanf("%d", &n);
    output_magic(n);
    return 0;
}