题解 | #序列重组矩阵#

#include <stdio.h>

int main()
{
    int n = 0;
    int m = 0;
    int arr[10] = { 0 };
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            scanf("%d", &arr[i]);
            printf("%d ", arr[i]);
        }
        printf("\n");
    }

    return 0;
}