题解 | #序列重组矩阵#

#include <stdio.h>
#define N 10
#define M 10
int main() {
    int n = 0;
    int m = 0;

    while (2 == scanf("%d %d", &n, &m))
    {
        int arr[N][M] = {0};
        int num = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                scanf("%d", &arr[i][j]);
            }
        }
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                printf("%d ", arr[i][j]);
            }
            printf("\n");
        }
    }
    return 0;
}