Submission

PPPPP

Score: 100

User: jarukeit

Problemset: หินงอก

Language: c

Time: 0.001 second

Submitted On: 2024-10-14 20:40:13

#include <stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    int arr[n];
    // max
    scanf("%d",&arr[0]);
    int max = arr[0];
    for(int i = 1;i < n;i ++)
    {
        scanf("%d",&arr[i]);
        if(max < arr[i])
        {
            max = arr[i];
        }
    }
    int count[n],tmp;
    for(int i = 0;i < n;i ++)
    {
        count[i] = 0;
    }
    //source
    for(int i = 0;i < max;i ++) // rows
    {
        for(int j = 0;j < n;j ++) //arrays
        {
            if(i >= arr[j]) // printf space แต่ละแถวหลังขึ้นบรรทัดใหม่
            {
                for(int k = 0;k < arr[j];k ++)
                {
                    printf(" ");
                    printf(" ");
                }
            }
            else
            {
                for(int k = arr[j] - i;k < arr[j];k ++)
                {
                    printf(" ");
                }
                printf("\\");
                for(int k = arr[j] - i - 1;k > 0;k --)
                {
                    printf(" ");
                    printf(" ");
                }
                printf("/");
                for(int k = arr[j] - i;k < arr[j];k ++)
                {
                    printf(" ");
                }
            }
        }
        if(i != max - 1)
        printf("\n");
    }
    return 0;
}