Submission

Status:

PPPPP

Subtask/Task Score:

100/100

Score: 100

User: HawThorns

Problemset: หินงอก

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-13 17:41:09

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;


int main(){
       int input,biggest = 0;
       cin >> input;
       vector<int> inputs;
       for(int i = 0; i < input;i++){
              int temp;
              cin >> temp;
              if(biggest < temp){
                     biggest = temp;
              }
              inputs.push_back(temp);
       }
       for(int i = 0;i < biggest;i++){
              for(int j = 0;j < input; j++){
                     for(int k = 0; k < inputs[j]*2; k++){
                            if( inputs[j]*2 -1 - i == k && i < inputs[j])
                                   cout << "/";
                            else if(i == k && i < inputs[j])
                                   cout << "\\";
                            else
                                   cout << " ";
                     }
              }
              cout << endl;
       }
       return 0;
}