顺时针旋转填充 2维数组

#include <vector>
#include <stdio.h>
using namespace std;

#define X 100
 
int A[X][X];

void FilltheEdge(int x, int y, int m, int n, int &cnt)
{
    int i = x, j =y;
    while(j<y+n-1)
        A[i][j++] = cnt++;

    while(i<x+m-1)
        A[i++][j] = cnt++;

    while(j>y)
        A[i][j--] = cnt++;

    while(i>x)
        A[i--][j] = cnt++;
}

int main()
{
    int M,N;
    while(scanf("%d%d", &M, &N)!=EOF)
    {
        int m = M, n = N;
        int x = 0, y =0;
        int cnt = 1;

        while(m>0&&n>0)
        {
            if(m == 1)
            {
                for(int k = y; k<y+n;++k)
                    A[x][k] = cnt++;
                break;
            }
            else if(n == 1)
            {
                for(int k = x; k<x+m;++k)
                    A[k][y] = cnt++;
                break;
            }
            else
            {
                FilltheEdge(x, y ,m, n, cnt);
                x++;
                y++;
                m-=2;
                n-=2;
            }
        }

        for(int i=0;i<M;i++)
        {
            for(int j = 0; j<N;j++)
                printf("%3d  ", A[i][j]);
            printf("\n");
        }
    }

    return 0;
}