Submission
Status:
-PPPP
Subtask/Task Score:
80/100
Score: 80
User: kenkong587
Problemset: หินงอก
Language: c
Time: 0.001 second
Submitted On: 2026-09-30 11:15:14
#include <stdio.h>
int main(){
int count = 0;
scanf("%d",&count);
int h[count];
for(int i = 0;i < count;i++){
scanf("%d",&h[i]);
}
int hmax = h[0];
for(int i = 1;i < count;i++){
if(h[i] > h[i-1]){
hmax = h[i];
}
}
for(int i = 0;i < hmax;i++){
for(int j = 0;j < count;j++){
if(h[j] < i+1){
for(int k = 0;k < h[j] * 2;k++){
printf(" ");
}
}
else{
for(int k = 0;k < i;k++){
printf(" ");
}
printf("\\");
for(int k = 0;k < (h[j] - 1 - i) * 2;k++){
printf(" ");
}
printf("/");
for(int k = 0;k < i;k++){
printf(" ");
}
}
}
printf("\n");
}
return 0;
}