Submission

-----

Score: 0

User: Angonnyyy

Problemset: กังหันสี่ทิศ

Language: cpp

Time: 0.001 second

Submitted On: 2024-10-03 16:22:46

#include<stdio.h>
#include<math.h>
int main(){
	int n,i,j,count;
	scanf("%d",&n);
	int s = 2*n-1;
	int maxindex = 2*n-2;
	int big = 64+n;
	int arr[s][s];
	int dok [s][s];
	for(i=0;i<s;i++){
		for(j=0;j<s;j++)arr[i][j]=0;
	}
	for(i=0;i<n;i++){
		arr[i][i] = big;
		arr[maxindex-i][i] = big;
		arr[i][maxindex-i] = big;
		arr[maxindex-i][maxindex-i] = big;
		big--;
	}
	for(i=0;i<s;i++){
		for(j=0;j<s;j++){
			if(arr[i][j]!=0)dok[i][j]=42;
			else dok[i][j]=0;
		}
	}
	
	for(i=0;i<s;i++){
		for(j=0;j<s;j++){
			printf("%c",arr[i][j]);
		}
		printf(" ");
		for(j=0;j<s;j++){
			printf("%c",dok[i][j]);
		}
		printf("\n");
	}

}