BOJ - [Array - 10997 별찍기 - 22 ] - Silver II🥈

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdbool.h>

int k=0, first_width, first_height,width,height,w_cursor=0,h_cursor=0;
bool arr[400][500],left_bottom = true;

void first_setup(int n) // 첫 준비 작업을 위한 함수
{
	first_width = width = 4*n-3;	//가로
	first_height = height = n != 1 ? 4*n-1 : 1;	//세로
	for(int i=0; i< (n == 1 ? 1 : height); i++)
		memset(arr[i],false,sizeof(bool)*(width));
	
	memset(arr[0],true,sizeof(bool)*width);
}
void set(int n)
{
	for(int k=0; height >= 3; k++)
	{
		if(k%2 == 1 && k > 0)
			h_cursor += 2;
		for(int i=0; i<height; i++)
			memset(arr[i+h_cursor]+(!left_bottom ? width+1 : first_width - width),true,sizeof(bool));
		memset(arr[left_bottom ? first_height-1-k: k+1] +w_cursor,true,sizeof(bool)*(first_width - (2*k)));
		height -= 2;
		if(k % 2 == 0)
			w_cursor += 2;
		left_bottom = !left_bottom;
		width = (!left_bottom) ? width - 2 : width;
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	first_setup(n);
	set(n);
	for(int i=0; i<first_height; i++) // 출력
	{
		for(int j=0; j<first_width; j++)
		{
			if(i != 1)
				printf("%c",arr[i][j] == true ? '*' : ' ');
			else if(arr[i][j] == true)
				printf("*");
		}
			
		printf("\n");
	}
    return 0;
}