Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: kimza
Problemset: หินงอก
Language: c
Time: 0.002 second
Submitted On: 2025-10-13 15:32:04
#include <stdio.h>
int main(){
int n = 0;
scanf("%d",&n);
int a[n];
int count=0;
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
count++;
}
int x = 0;
int max = a[0];
for(int i=0;i<count;i++){
if(a[i]>max){
max = a[i];
}
}
for(int i=0;i<max;i++){
while(x!=count){
for(int j=0;j<a[x]*2;j++){
if(i==j && i < a[x] && j < a[x]){
printf("\\");
}
else if(i+j == (a[x]*2)-1 && i < j){
printf("/");
}
else{
printf(" ");
}
}
x++;
}
x=0;
printf("\n");
}
return 0;
}