7-8 螺旋方阵

#include <stdio.h> 
#define M 10 
 
int main() 
{ 
    int a[M][M]; 
    int n, i = 0, j = 0, loop = 0, count = 1; 
     
    scanf("%d", &n); 
    a[0][0] = count++; 
    while (loop < n/2) { 
        while (++j < n - loop) { 
            a[i][j] = count++; 
        } 
        j--; 
        while (++i < n - loop) { 
            a[i][j] = count++; 
        } 
        i--; 
        while (--j >= loop) { 
            a[i][j] = count++; 
        } 
        j++; 
        while (--i > loop) { 
            a[i][j] = count++; 
        } 
        i++; 
         
        loop++; 
    } 
    if (n % 2 && n != 1) { 
        a[n/2][n/2] = count; 
    } 
    for (i=0; i<n; i++) { 
        for (j=0; j<n; j++) { 
            printf("%3d", a[i][j]); 
        } 
        printf("\n"); 
    } 
     
    return 0; 
}