#. Problemhttps://www.acmicpc.net/problem/17389* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Codeㅇ Python123456789101..
#. Problemhttps://www.acmicpc.net/problem/17269* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve1. 두 사람의 이름을 한 글자씩 ..
[Inflearn] 라이언 킹 심바(BFS, priority_queue) (c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 각 격자에는 토기 한 마리가 있거나 없을 수 있음 - 심바와 토끼는 모두 몸 크기를 자연수로 가지고 있음 - 처음 심바의 크기는 2이고 심바는 1초에 인접한 상하좌우 격자칸으로 이동 가능 - 자신의 몸 크기와 같은 마리수 만큼 잡아먹으면 몸의 크기 1 증가 - 0은 빈칸이고, 각 토끼의 크기(1, 2, 3, 4, 5, 6, 7)..
[Inflearn] 토마토(BFS) (c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 익은 토마토들의 인접한 곳에 있는 익지 않은 토마토들은 익은 토마토의 영향을 받아 익음 - 대각선 방향에 있는 토마토들은 혼자 못 익음 - 상자의 일부 칸에는 토마토가 들어있지 않을 수 있음 - M : 가로, N : 세로 (2
[Inflearn] 미로의 최단거리 통로(BFS)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 미로 탈출 최단 경로의 이동한 횟수 - 격자판의 1은 벽이고, 0은 도로 - 격자판의 움직임은 상하좌우로만 움직임 - 도착할 수 없으면 '-1' 출력 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time..
[Inflearn] 섬나라 아일랜드(BFS)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 각 섬은 1로 표시, 0은 바다 - 상하좌우와 대각선으로 연결 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look ..
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 0은 빈칸, 1은 집, 2는 피자집 - 행과 열은 1번부터 N번까지 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Lo..
[Inflearn] 조합구하기(DFS) (c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..