whitespace

Solution

#include<stdio.h>

int main(void)
{
	printf("Avengers: Endgame\n");

	return 0;
}

Solution

#include<stdio.h>

int main(void)
{
	int T;

	scanf("%d", &T);

	for(int t=0;t<T;t++)
	{
		int N, M;

		scanf("%d %d", &N, &M);

		printf("%d\n", (N>=12&&M>=4)?11*M+4:-1);
	}

	return 0;
}

Solution

#include<stdio.h>

int main(void)
{
	int N, i, j;

	scanf("%d", &N);

	for(i=0;i<N;i++)
		printf("*");
	for(i=0;i<2*N-3;i++)
		printf(" ");
	for(i=0;i<N;i++)
		printf("*");
	printf("\n");

	for(i=2;i<N;i++)
	{
		for(j=1;j<i;j++)
			printf(" ");
		printf("*");
		for(j=1;j<N-1;j++)
			printf(" ");
		printf("*");
		for(j=0;j<2*(N-i)-1;j++)
			printf(" ");
		printf("*");
		for(j=1;j<N-1;j++)
			printf(" ");
		printf("*");
		printf("\n");
	}

	for(i=1;i<N;i++)
		printf(" ");
	printf("*");
	for(i=1;i<N-1;i++)
		printf(" ");
	printf("*");
	for(i=1;i<N-1;i++)
		printf(" ");
	printf("*");
	printf("\n");

	for(i=N-1;i>1;i--)
	{
		for(j=1;j<i;j++)
			printf(" ");
		printf("*");
		for(j=1;j<N-1;j++)
			printf(" ");
		printf("*");
		for(j=0;j<2*(N-i)-1;j++)
			printf(" ");
		printf("*");
		for(j=1;j<N-1;j++)
			printf(" ");
		printf("*");
		printf("\n");
	}

	for(i=0;i<N;i++)
		printf("*");
	for(i=0;i<2*N-3;i++)
		printf(" ");
	for(i=0;i<N;i++)
		printf("*");
	printf("\n");

	return 0;
}

2

Solution

#include<stdio.h>

long long int koongFibonacci[68]={0, };

long long int koong(int N)
{
	if(koongFibonacci[N]!=0)
		return koongFibonacci[N];
	koongFibonacci[N]=koong(N-1)+koong(N-2)+koong(N-3)+koong(N-4);
	return koongFibonacci[N];
}

int main(void)
{
	int t, n;

	koongFibonacci[0]=koongFibonacci[1]=1;
	koongFibonacci[2]=2;
	koongFibonacci[3]=4;

	scanf("%d", &t);
	for(int i=0;i<t;i++)
	{
		scanf("%d", &n);
		printf("%lld\n", koong(n));
	}

	return 0;
}

Solution

#include<stdio.h>
#include<stdlib.h>
#include<memory.h>
#include<string.h>

typedef int element;
typedef struct DlistNode
{
	element data;
	struct DlistNode *llink;
	struct DlistNode *rlink;
}
DlistNode;

void init(DlistNode *phead)
{
	phead->llink=phead;
	phead->rlink=phead;
	phead->data=-1;
}

void push_front(DlistNode *before,DlistNode *new_node)
{
	while(before->llink->data!=-1)
		before=before->llink;

	new_node->llink=before->llink;
	new_node->rlink=before;

	before->llink->rlink=new_node;
	before->llink=new_node;
}

void push_back(DlistNode *before,DlistNode *new_node)
{
	while(before->rlink->data!=-1)
		before=before->rlink;

	new_node->llink=before;
	new_node->rlink=before->rlink;

	before->rlink->llink=new_node;
	before->rlink=new_node;
}

void dremove_node(DlistNode *phead_node,DlistNode *removed)
{
	if(removed==phead_node)
		return;

	removed->llink->rlink=removed->rlink;
	removed->rlink->llink=removed->llink;

	free(removed);
}

int pop_front(DlistNode *phead_node)
{
	int N=phead_node->rlink->data;

	dremove_node(phead_node,phead_node->rlink);
	return N;
}

int pop_back(DlistNode *phead_node)
{
	int N=phead_node->llink->data;

	dremove_node(phead_node,phead_node->llink);
	return N;
}

int front(DlistNode *phead_node)
{
	return phead_node->rlink->data;
}

int back(DlistNode *phead_node)
{
	return phead_node->llink->data;
}

int main(void)
{
	DlistNode head_node, **deque=NULL;
	int N, size=0, num;

	scanf("%d", &N);
	while(getchar()!='\n');

	deque=(DlistNode **)malloc(sizeof(DlistNode *)*N);
	init(&head_node);

	for(int i=0;i<N;i++)
	{
		char command[30]={'\0', };

		fgets(command,sizeof(command),stdin);
		deque[i]=(DlistNode *)malloc(sizeof(DlistNode));

		if(strncmp(command,"push_front",10)==0)
		{
			for(int j=11;command[j]!='\0';j++)
				command[j-11]=command[j];

			deque[i]->data=atoi(command);
			push_front(&head_node,deque[i]);
			size++;
		}
		else if(strncmp(command,"push_back",9)==0)
		{
			for(int j=10;command[j]!='\0';j++)
				command[j-10]=command[j];

			deque[i]->data=atoi(command);
			push_back(&head_node,deque[i]);
			size++;
		}
		else if(strncmp(command,"pop_front",9)==0)
		{
			num=pop_front(&head_node);
			printf("%d\n", num);
			free(deque[i]);
			size-=num!=-1;
		}
		else if(strncmp(command,"pop_back",8)==0)
		{
			num=pop_back(&head_node);
			printf("%d\n", num);
			free(deque[i]);
			size-=num!=-1;
		}
		else if(strncmp(command,"size",4)==0)
		{
			printf("%d\n", size);
			free(deque[i]);
		}
		else if(strncmp(command,"front",5)==0)
		{
			printf("%d\n", front(&head_node));
			free(deque[i]);
		}
		else if(strncmp(command,"back",4)==0)
		{
			printf("%d\n", back(&head_node));
			free(deque[i]);
		}
		else if(strncmp(command,"empty",5)==0)
		{
			printf("%d\n", size==0);
			free(deque[i]);
		}
		else
		{
			printf("error\n");
			free(deque[i]);
		}
	}

	return 0;
}

Solution

#include<stdio.h>

int main(void)
{
	printf("문제의 정답");

	return 0;
}

Solution

#include<stdio.h>

int main(void)
{
	int a, b, c, d, e, f;

	scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &f);

	printf("%d %d\n", (b*f-c*e)/(b*d-a*e), (a*f-c*d)/(a*e-b*d));

	return 0;
}

Solution

#include<stdio.h>
#include<stdlib.h>
#define SWAP(x,y,t) ((t)=(x),(x)=(y),(y)=(t))

int partition(int list[],int left,int right)
{
	int pivot=list[left], temp, low=left, high=right+1;

	do
	{
		do
			low++;
		while(low<=right&&list[low]<pivot);
		do
			high--;
		while(high>=left&&list[high]>pivot);

		if(low<high)
			SWAP(list[low],list[high],temp);
	}
	while(low<high);

	SWAP(list[left],list[high],temp);

	return high;
}

void quick_sort(int list[],int left,int right)
{
	if(left<right)
	{
		int q=partition(list,left,right);
		quick_sort(list,left,q-1);
		quick_sort(list,q+1,right);
	}
}
int main(void)
{
	int N, *list=NULL;

	scanf("%d", &N);

	list=(int *)malloc(N*sizeof(int));

	for(int i=0;i<N;i++)
		scanf("%d", list+i);

	quick_sort(list,0,N-1);

	for(int i=0;i<N;i++)
		printf("%d\n", *(list+i));

	free(list);
	return 0;

}