题解 | #序列重组矩阵#
序列重组矩阵
http://www.nowcoder.com/practice/7548f8f5e44c42fa84fb2323d899a966
int main() {
int n, m;
scanf("%d %d", &n, &m);
int val[n * m];
for (int i = 0; i < n * m; i++) {
scanf("%d ", &val[i]);
printf("%d ", val[i]);
if ((i + 1) % m == 0) printf("\n");
}
return 0;
}
百度一面666人在聊