Submission

[-SSSSSSSS]

Score: 0

User: TirpitZ

Problemset: ภูเขา

Language: c

Time: 0.002 second

Submitted On: 2024-10-16 14:52:28

#include<stdio.h>

int main()
{
    int n;
    scanf("%d",&n);
    int moutain[n];
    int max=0;
    int cnt[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&moutain[i]);
        cnt[i]=moutain[i]-1;
        if(max<moutain[i])        max=moutain[i];
    }
    for(int line=0;line<max;line++)
    {
        for(int which=0;which<n;which++)
        {
            if(line<max-moutain[which])    
            {
                for(int pos=0;pos<moutain[which]*2;pos++)    printf(" ");
            }
            else
            {
                for(int pos=0;pos<cnt[which];pos++)    printf(" ");
                printf("/");
                for(int pos=0;pos<2*(moutain[which]-1-cnt[which]);pos++)    printf(" ");
                printf("\\");
                for(int pos=0;pos<cnt[which];pos++)    printf(" ");
                cnt[which]--;
            }
        }
        printf("\n");
    }
}