二维数组—S型排座问题

S型排座问题

1  6  7  12

2  5  8  11

3  4  9  10

#include<stdio.h>
int main()
{
    int n, m, s[100][100], z, i, j;
    while(scanf("%d%d", &n, &m) != EOF)
    {
        z = 1;
        for(j = 1; j <= m; j++)
        {
            if(j % 2 != 0)
            {
                for(i = 1; i <= n; i++)
                {
                    s[i][j] = z;
                    z++;
                }
            }
            else
            {
                for(i = n; i >= 1; i--)
                {
                    s[i][j] = z;
                    z++;
                }
            }
        }
        for(i = 1; i <= n; i++)
        {
            for(j = 1; j <= m; j++)
            {
                printf("%02d%c", s[i][j], j == m ? '\n' : ' ');
            }
        }
    }
    return 0;
}

//根据列数是奇数还是偶数，设一个z值，让z值累加