[참고] 4주차 실습(배열) 문제 4 about 2020.spring.datastructure HOT 1 CLOSED

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>


int main()
{
    int x[100][100] = { 0 };
    int N, M, i, a = 0, b = 0;
    int p, q, k;
    scanf("%d %d", &N, &M);
    p = M; q = N - 1;
    k = p;
    p--;
    int flag = 0;
    for (i = 1; i <= N * M; i++)
    {
        x[a][b] = i;
        if (i == k)
        {
            flag++;
            if (flag % 2 == 0) { k += p; p--; }
            else { k += q; q--; }        
        }
        switch (flag % 4)
        {
        case 0: b++; break;
        case 1: a++; break;
        case 2: b--; break;
        case 3: a--; break;
        }
        
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < M; j++) printf(" %d", x[i][j]);
        printf("\n");
    }
    return 0;
}

// 19011851