Submission

[PPPPPPPPP]

Score: 100

User: putter16488

Problemset: ภูเขา

Language: cpp

Time: 0.001 second

Submitted On: 2024-09-27 14:30:37

#include<stdio.h>

main(){
	int n,a[100],max=0,temp,Mday[100];
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
		Mday[i]=1;
		if(a[i]>max){
			max=a[i];
		}
	}
	for(int i=max;i>0;i--){
		for(int k=0;k<n;k++){
			if(a[k]>=i){
				for(int j=0;j<2*a[k];j++){
					if(j==a[k]-Mday[k]){
						printf("/");
					}
					else if(j==a[k]+Mday[k]-1){
						printf("\\");
						
					}
					else{
						printf(".");
					}	
				}
				Mday[k]+=1;
			}
			else{
				for(int l=0;l<2*a[k];l++){
					printf(".");
				}
			}
		}
		printf("\n");
	}
}