题解 | #蛇形矩阵#
蛇形矩阵
https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int j = n;
for(;j > 0;j--){
int start = 1 + (1 + n - j)*(n - j)/2;
for(int k = 0;k < j;k++){
printf("%d ",start);
start += k + 2 + n - j;
}
printf("\n");
}
return 0;
}
int main(){
int n;
scanf("%d",&n);
int j = n;
for(;j > 0;j--){
int start = 1 + (1 + n - j)*(n - j)/2;
for(int k = 0;k < j;k++){
printf("%d ",start);
start += k + 2 + n - j;
}
printf("\n");
}
return 0;
}