Submission
Status:
PPPPP
Subtask/Task Score:
100/100
Score: 100
User: Mocha_nb
Problemset: หินงอก
Language: cpp
Time: 0.002 second
Submitted On: 2025-10-07 20:29:02
#include <stdio.h>
int main(){
int n,arr[20],max = -9999999;
scanf("%d",&n);
for(int i =0;i<n;i++){
scanf("%d",&arr[i]);
if(arr[i]>max){
max = arr[i];
}
}
for(int i =0;i<max;i++){
for(int k=0;k<n;k++){
for(int j=0;j<arr[k]*2;j++){
if(i==j && i <= arr[k]-1){
printf("\\");
}else if(i+j == arr[k]*2-1 && i <= arr[k]-1){
printf("/");
}else{
printf(" ");
}
}
}
printf("\n");
}
}