Submission

Score: 100

User: tha_smith

Problemset: หินงอก

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-06 21:45:08

#include <iostream>
#include <cstring>
using namespace std;

int main() {
    int n,sum=0,max=0;
    cin >> n;
    int lvl[n];
    int done[n];
    memset(done,0,sizeof(done));
    for(int i=0;i<n;i++) {
    	cin >> lvl[i];
    	sum += lvl[i];
    	if(lvl[i]>max) {
    		max=lvl[i];
		}
	}
	int p = 0;
    for(int i=1; i<=max; i++) {
    	for(int k=0; k<n; k++) {
          for(int j=1; j<=2*lvl[k]; j++) {
          	if(done[k]==1) {
          		cout << " ";
          	}
          	
			else {
            if(j==i) {
                cout << "\\";
            }
            else if(j==2*lvl[k]-p) {
            	cout << "/";
			}
            else {
                cout << " ";
            }
        }
		}
        if(i==lvl[k]) {
            done[k]++;
	   }
    }
    p++;
    if(i<max) {
    	cout << endl;
    }
}
}