#include<cstdio>constchar ch ='*';intmain(void){int N, M;scanf("%d",&M);while(M--){scanf("%d",&N);int tot = N +2*(N-1);//每层总数for(int i =1; i <= N; i++){for(int k =1; k <= N - i; k++)printf(" ");for(int j =1; j <= N +2*(i -1); j++)printf("%c", ch);printf("\n");}}return0;}
#include<cstdio>constchar ch ='*';intmain(void){int n;while(scanf("%d",&n)!=EOF){for(int i =1; i <= n; i++)//倒三角输出{for(int j =1; j <= i -1; j++)printf(" ");int flag =1;for(int k = i -1; k <=2* n - i; k++){if(flag){printf("%c", ch); flag =0;}else{printf(" "); flag =1;}}printf("\n");}//正三角输出,由于对称性,所以直接把倒三角倒数两层反着输出就行了for(int i = n -1; i >=1; i--){for(int j =1; j <= i -1; j++)printf(" ");int flag =1;for(int k = i -1; k <=2* n - i; k++){if(flag){printf("%c", ch); flag =0;}else{printf(" "); flag =1;}}printf("\n");}}return0;}