Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: KantaponZ
Problemset: B.Nai/SiraSira
Language: cpp
Time: 0.005 second
Submitted On: 2025-09-24 23:36:25
#include <bits/stdc++.h>
using namespace std;
int N;
int A[105];
int maxA = 0;
char G[1000][1000];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i], maxA = max(maxA, A[i]);
int L = 0, R = 3;
//cout << maxA;
for (int i = 0; i < 1000; i++) {
for (int j = 0; j < 1000; j++) {
G[i][j] = ' ';
}
}
for (int k = 1; k <= N; k++) {
for (int i = L; i <= R; i++) {
for (int j = 2*(maxA - A[k]); j < 2 * maxA; j++) {
G[j][i] = '#';
}
}
//cout << L << " " << R << "\n";
L += 6, R += 6;
}
for (int i = 0; i < 2 * maxA; i++) {
for (int j = 0; j < 6 * N - 2; j++) {
cout << G[i][j];
}
cout << "\n";
}
}