Submission

[PPPPPPPPP]

Score: 100

User: Angonnyyy

Problemset: ภูเขา

Language: c

Time: 0.001 second

Submitted On: 2024-09-29 12:18:39

//mountain
#include <stdio.h>

int main() {
    int n,i,j,k=0,max = 0,length=0;
    scanf("%d",&n);
    int want[n];
    for(i=0;i<n;i++){
        scanf("%d",&want[i]);
        if(want[i]>max)max = want[i];
        length = length + want[i]*2;
    }
    char pic[max][length];
    for(j=0;j<max;j++){
        for(k=0;k<length;k++){
            pic[j][k] = 0;
        }
    }
    k = 0;
    for(i=0;i<n;i++){
        for(j=max-1;j>=max-want[i];j--){
            pic[j][k] = '/';
            k++;
        }
        for(j+=1;j<=max-1;j++){
            pic[j][k] = '\\';
            k++;
        }
    }
    for(j=0;j<max;j++){
        for(k=0;k<length;k++){
            if(pic[j][k]==0)printf(".");
            else printf("%c",pic[j][k]);
        }
        printf("\n");
    }
    
}