题解 | #圣诞树#
圣诞树
https://www.nowcoder.com/practice/9a03096ed8ab449e9b10b0466de29eb2
#include <stdio.h>
int main(){
int n,t;
char c;
scanf("%d %c",&n,&c);
t=3*n-1;
int i=1;
while(i<=3*n){
int m;
m=i;
int a=0;
while(a<t){
printf(" ");a ++;
}
int cnt=1,b,d=1;
while(i>3){i=i-3;cnt ++;
}while(d<=cnt){
if(i==1){printf("%c ",c);
}
if(i==2){printf("%c %c ",c,c);
}
if(i==3){printf("%c %c %c ",c,c,c);
}
d ++;
}printf("\n");
i=m;
t --;
i ++;
}
int v=1;
while(v<=n){int p=1;
while(p<=3*n-1){printf(" ");p ++;
}
printf("%c\n",c);v ++;
}
return 0;
#我的圣诞帽#
int main(){
int n,t;
char c;
scanf("%d %c",&n,&c);
t=3*n-1;
int i=1;
while(i<=3*n){
int m;
m=i;
int a=0;
while(a<t){
printf(" ");a ++;
}
int cnt=1,b,d=1;
while(i>3){i=i-3;cnt ++;
}while(d<=cnt){
if(i==1){printf("%c ",c);
}
if(i==2){printf("%c %c ",c,c);
}
if(i==3){printf("%c %c %c ",c,c,c);
}
d ++;
}printf("\n");
i=m;
t --;
i ++;
}
int v=1;
while(v<=n){int p=1;
while(p<=3*n-1){printf(" ");p ++;
}
printf("%c\n",c);v ++;
}
return 0;
}//不错哟