题解 | #序列重组矩阵#

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