Submission

Score: 100

User: peilin

Problemset: หินงอก

Language: c

Time: 0.002 second

Submitted On: 2025-10-12 20:40:59

#include<stdio.h>

int main() {
	int i,j,a[20],n,max=0,m;
	scanf("%d", &n);
	for(i=0; i<n; i++) {
		scanf("%d", &a[i]);
		if(max<a[i]) {
			max=a[i];
		}
	}
	for(i=0; i<max; i++) {
		for(m=0; m<n; m++) {	
			for(j=0; j<2*a[m]; j++) {
				if(i==j && i<a[m]) {
					printf("\\");
				} else if(i+j==2*a[m]-1 && i<a[m]) {
					printf("/");
				} else {
					printf(" ");
				}
			}
		}	 
		printf("\n");
    }
	return 0;
}