Submission

Status:

PPPPPPPPPP

Score: 100

User: Dormon

Problemset: B.Nai/SiraSira

Language: cpp

Time: 0.002 second

Submitted On: 2024-12-03 10:41:50

#include <iostream>

using namespace std;
const int N = 103;

int a[N<<2];

int main()
{
    int n, mx = 0, cnt = 0; scanf("%d", &n);
    for (int i = 0;i < n;i++){
        int h; scanf("%d", &h); mx = max(mx, h<<1);
        for (int j = 0;j < 4;j++) a[cnt++] = h<<1;
        cnt += 2;
    }
    for (int i = mx;i > 0;i--){
        for (int j = 0;j < 6*n-2;j++){
            if (i <= a[j]) printf("#");
            else printf(" ");
        }
        printf("\n");
    }
}