二维数组的周游

#define _CRT_SECURE_NO_DEPRECATE
#include<stdio.h>
int main()
{

    int year1;
    char arr[82][82];
    char ch[2] = { '@','W' };
    int n = 7, f = 0;
    char x;
    int i = 0, j = 0, k, h;
    bool flag = true;
    for (k = n - 1; k>0; k -= 2)
    {
        if (flag)
        {
            x = ch[0];
            flag = false;
        }
        else
        {
            x = ch[1];
            flag = true;
        }
        for (h = 0; h<k; h++)
            arr[i][j + h] = x;
        j = j + k;
        for (h = 0; h<k; h++)
            arr[i + h][j] = x;
        i = i + k;
        for (h = 0; h<k; h++)
            arr[i][j - h] = x;
        j = j - k;
        for (h = 0; h<k; h++)
            arr[i - h][j] = x;
        i = i - k + 1;
        j = j + 1;
    }
    arr[i][j] =flag? ch[0]:ch[1];
    arr[0][0] = arr[0][n - 1] = arr[n - 1][n - 1] = arr[n - 1][0] = ' ';
    for (i = 0; i<n; i++)
    {
        for (j = 0; j<n; j++)
            printf("%c ", arr[i][j]);
        printf("
");
    }



    bool flag1 = true;
    while (scanf("%d", &year1) == 1)
    {
        if (flag1)
            flag1 = false;
        else
            printf("
");
        printf("%d", year1);
    }
    return 0;
}

原文地址:https://www.cnblogs.com/BetterThanEver_Victor/p/8611002.html