Submission

PPPPP

Score: 100

User: TirpitZ

Problemset: หินงอก

Language: c

Time: 0.002 second

Submitted On: 2024-10-05 15:59:38

#include<stdio.h>
int main()
{
	int n;
	scanf("%d",&n);
	int dripstone[n];
	int max=-10000;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&dripstone[i]);
		if(dripstone[i]>max)	max=dripstone[i];
	}
	int cnt,temp;
	for(int line=0;line<max;line++)			//run for line
	{
		for(int k=0;k<n;k++)				//loop for which stone
		{
			temp=dripstone[k]*2-1;
			if(dripstone[k]>line)
			{
				for(int i=0;i<line;i++)						printf(" ");
				for(int t=0;t<temp+1;t++)
				{
					if(t==line)							printf("\\");
					else if(t==(temp-line))				printf("/");
					else if(t>line && t<temp-line)		printf(" ");
				}
				for(int i=0;i<line;i++)						printf(" ");
			}
			else
			{
				for(int i=0;i<dripstone[k]*2;i++)			printf(" ");
			}
		}
		printf("\n");
	}
}