题解 | #圣诞树#
圣诞树
https://www.nowcoder.com/practice/9a03096ed8ab449e9b10b0466de29eb2
#include<stdio.h>
int main()
{
int h;
int count = 1;
scanf("%d", &h);
int cen = h * 3;
for (int i = 1; i <= cen; i++)
{
for (int j = 1; j <= cen - i; j++)
{
printf(" ");
}
for (int m = i,j = i; j> 0; j-=3)
{
if (m == 1 || m % 3 == 1)
printf("* ");
else if (m == 2 || m% 3 == 2)
printf("* * ");
else if (m == 3 || m% 3 == 0)
printf("* * * ");
}
printf("\n");
}
for (int i = 1; i <= h; i++)
{
for (int i = 1; i <= cen-1; i++)
printf(" ");
printf("*\n");
}
return 0;
}

查看16道真题和解析