题解 | #序列重组矩阵#够不够简短
序列重组矩阵
https://www.nowcoder.com/practice/7548f8f5e44c42fa84fb2323d899a966
#include <stdio.h>
int main() {
int a, b,count=0;
scanf("%d %d", &a, &b);
while(~scanf("%d",&a)){
printf("%d ",a);
if(++count%b==0)
printf("\n");
}
return 0;
}
查看14道真题和解析
