Submission

[PPPPPPTSS]

Score: 0

User: tankunkid

Problemset: ภูเขา

Language: c

Time: 1.065 second

Submitted On: 2024-09-28 10:04:22

#include <stdio.h>
#include <math.h>

int main() {
	int N, max1, s;
	scanf("%d", &N);
	int arr[N];
	for (int i = 0; i < N; i++) {
		scanf("%d", &arr[i]);
	}
	for (int i = 0; i < N; i++) {
		if (arr[i] > max1) {
			max1 = arr[i];
		}
	}
	for (int r = 0; r < max1; r++) {
		for (int i = 0; i < N; i++) {
			if (arr[i] >= max1-r) {
                int d = max1-r;
				for (int j = 0; j < max1-r-1; j++) {
					printf(".");
				}
				printf("/");
				for (int j = 0; j < (arr[i]-max1+r)*2; j++) {
					printf(".");
				}
				printf("\\");
				for (int j = 0; j < max1-r-1; j++) {
					printf(".");
				}
			} else {
				for (int j = 0; j < arr[i]*2; j++) {
					printf(".");
				}
			}
		}
		printf("\n");
	}
}