Submission

Score: 100

User: Peam

Problemset: หินงอก

Language: c

Time: 0.002 second

Submitted On: 2025-10-08 16:29:42

#include <stdio.h>
int main(){
    int n;
    scanf("%d", &n);

    int r[n];
    int max = -99;
    for(int i = 0; i < n; i++){
        scanf("%d", &r[i]);
        if(r[i] > max){
            max = r[i];
        }
    }

    for(int i = 0; i < max; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < 2 * r[j]; k++){
                if(i < r[j] && i == k){
                    printf("\\");
                }
                else if(i < r[j] && i + k == 2 * r[j] - 1){
                    printf("/");
                }
                else{
                    printf(" ");
                }
            }
        }
        printf("\n");
    }

    return 0;
}