题解 | 序列重组矩阵

#include<stdio.h>
int main()
{
	int num[100],n,m;
	int* p=num;//指针指向num的起始地址
	//printf("请输入数字：\n");
	scanf("%d %d", &n,&m);
	int t = n * m;
	//printf("请输入%d个数\n",t);
	for (int i = 0; i < t; i++)
	{
		scanf("%d", &num[i]);
		//*p = num[i];
	}
	
	//遍历数组
	int arr[10][10];
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			arr[i][j] = *p;
			printf("%d", *p);
			p++;
			printf(" ");
		}
		printf("\n");
	}
	return 0;
}