题解 | #序列重组矩阵#
序列重组矩阵
https://www.nowcoder.com/practice/7548f8f5e44c42fa84fb2323d899a966
#include <stdio.h>
int main() {
int n,m;
scanf("%d %d", &n, &m);
int a[n][m];
//简答题目，扫描直接打印就是了
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
scanf("%d",&a[i][j]);
printf("%d ",a[i][j]);
}
printf("\n");
}
return 0;
}
