All Stories
[C] Algorithm : Backjoon 14500 테트로미노
Baekjoon Problem 14500 is tetromino. Please check the details and pictures of the problem in Baekjonn. For uncomplicated algorithmic problems, it is possible to code the problem right...
In C, Dec 22, 2020[C] Algorithm : Backjoon 14499 주사위 굴리기
Baekjoon Problem 14499 is roll the dice. Please check the details and pictures of the problem in Baekjonn. For uncomplicated algorithmic problems, it is possible to code the problem r...
In C, Dec 22, 2020[C] Algorithm : Backjoon 13458 시험 감독
Baekjoon Problem 13458 is test supervision. Please check the details and pictures of the problem in Baekjonn. For uncomplicated algorithmic problems, it is possible to code the proble...
In C, Dec 22, 2020[C] BFS(Breadth First Search) 너비 우선 탐색
In this article, I will focus on breadth first search. BFS is a search algorithm that proceeds in the form of an octopus when the list of vertices going from vertex A to B is differen...
In C, Dec 21, 2020[C] DFS(Depth First Search) 깊이 우선 탐색
When explaining the graph data structure, we learned about the path. The list of vertices that goes through to move from vertex A to B may be different, and thus each may have differe...
In C, Dec 20, 2020