题解 | 序列重组矩阵
序列重组矩阵
https://www.nowcoder.com/practice/7548f8f5e44c42fa84fb2323d899a966
#include <stdio.h>
int main() {
int n, m;
int arr[100] = { 0 };
scanf("%d %d", &n, &m);
int i = 0;
for (i = 0;i < n * m;i++)
{
scanf("%d", &arr[i]);
}
int j = 0;
for (i = 0;i < n;i++)
{
for (j = 0;j < m;j++)
{
printf("%d ",arr[j + i*m]);
}
printf("\n");
}
return 0;
}
