题解 | #序列重组矩阵#

#include <stdio.h>

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