Submission

Score: 100

User: modx9572

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-09-30 13:41:51

#include <iostream>
#include <math.h>
#include <string.h>
using namespace std;

int main(){
    int N;
    cin >> N;
    int n[N];
    int max = -999999;
    for(int i = 0; i < N; i++){
        cin >> n[i];
        if(n[i] > max){
            max = n[i];
        }
    }
    int size = n[0];
    for(int j = 0; j < max; j++){
        for(int i = 0; i < N; i++){
            for(int k = 0; k < n[i]; k++){
                if(j == k){
                    cout << '\\';
                }
                else{
                    cout << " ";
                }
            }
            for(int k = 0; k < n[i]; k++){
                if(j + k == n[i] - 1){
                    cout << '/';
                }
                else{
                    cout << " ";
                }
            }
        }
        cout << "\n";
    }
}