题解 | #序列重组矩阵#

#include <stdio.h>

int main()
 {
    int n = 0, m = 0, a[100];
    int i, j, z = 0;
    scanf("%d%d", &n, &m);
    for (i = 0; i < n * m; i++)
    {
        scanf("%d", &a[i]);
    }
    int k = m;
    for (i = 0; i < n; i++) 
    {
        for (j = z; j < k; j++) 
        {
            printf("%d ", a[j]);
        }
        z += m;
        k += m;
        printf("\n");
    }
    
    return 0;
 }