题解 | 序列重组矩阵

#include <stdio.h>

int main() 
{
    int n = 0;
    int m = 0;
    while (scanf("%d %d", &n, &m) == 2)
    {
        int a = n * m;
        int arr[a];
        int i = 0;
        for (i = 0; i < a; i++)
        {
            scanf("%d", &arr[i]);
            printf("%d ", arr[i]);
            if ((i + 1) % m == 0)
                printf("\n");
        }
        
    }
    return 0;
}