Submission
Status:
[PPPPPPPPP]
Score: 100
User: Cmoss9
Problemset: ภูเขา
Language: c
Time: 0.001 second
Submitted On: 2024-10-16 23:07:28
#include <stdio.h>
int main () {
int n;
scanf("%d",&n);
int arr[n];
for (int i = 0;i<n;i++) {
scanf("%d",&arr[i]);
}
int maxheight = arr[0];
for (int i = 0;i<n;i++) {
if (maxheight<arr[i]) {
maxheight = arr[i];
}
}
for (int row = 0;row<maxheight;row++) {
for (int i = 0;i<n;i++) {
if (row<maxheight-arr[i]) {
for (int j = 0;j<arr[i]*2;j++) {
printf(".");
}
} else {
for (int j = 0;j<arr[i];j++) {
if (j==arr[i]-row-1+maxheight-arr[i]) {
printf("/");
} else {
printf(".");
}
}
for (int j = 0;j<arr[i];j++) {
if (j==row-maxheight+arr[i]) {
printf("\\");
} else {
printf(".");
}
}
}
}
printf("\n");
}
}