题解 | #序列重组矩阵#

#include <stdio.h>
int main() {
    int a = 0, b = 0;
    int sum = 0;
    int i = 0, j = 0;
    int m = 0, n = 0;
    int arr[1000] = { 0 };
    scanf("%d %d", &n, &m);
    for (i = 0; i < n * m; i++) {
        scanf("%d", &arr[i]);
    }
    for (i = 0; i < n * m; i++) {
        printf("%d ", arr[i]);
        sum++;
        if (sum % m == 0)
            printf("\n");
    }
    return 0;
}