题解 | #序列重组矩阵#
序列重组矩阵
https://www.nowcoder.com/practice/7548f8f5e44c42fa84fb2323d899a966
//第二种写法
#include <stdio.h>
int main() {
int n, m = 0;
int arr[10][10] = {0};
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;
}
c语言刷题 文章被收录于专栏
c语言刷题题目
