[BOJ] 1600. 말이 되고픈 원숭이(BFS).java

#. Problemhttps://www.acmicpc.net/problem/1600* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand the problem 2. Redefine the problem + abstract 3. Create a 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 #. Solve 최소의 동작으로 목적지까..
PS/Problem_Solving 2020. 8. 18. 23:35
[BOJ] 14502. 연구소(DFS, DFS).java

#. Problemhttps://www.acmicpc.net/problem/14502* 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 #. Solve 이 문제를 해결하기 위해 전체적으..
PS/Problem_Solving 2020. 8. 16. 23:37
[BOJ] 1941. 소문난 칠공주(조합, DFS, BFS).java

#. Problemhttps://www.acmicpc.net/problem/1941* 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 #. Solve 단 4가지 규칙만 잘 지키면 된다...
PS/Problem_Solving 2020. 8. 15. 02:09
[BOJ] 1167.트리의 지름(그래프, DFS).java

#. Problemhttps://www.acmicpc.net/problem/1167* 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 #. Solve 안타깝게도 1번 정점이 무조건 Ro..
PS/Problem_Solving 2020. 8. 13. 22:43
[BOJ] 1261.알고스팟(priorityQueue).java

#. Problemhttps://www.acmicpc.net/problem/1261* 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 #. Solve 처음에 무작정 그냥 Queue로 풀..
PS/Problem_Solving 2020. 8. 12. 23:29
[BOJ] 19542.전단지 돌리기(그래프, DFS).java

#. Problemhttps://www.acmicpc.net/problem/19542* 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 #. Solve 리프 노드까지 쭉 내려갔다가올라오..
PS/Problem_Solving 2020. 8. 12. 00:40
[BOJ] 2644.촌수계산(BFS).java

#. Problemhttps://www.acmicpc.net/problem/2644* 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 #. Solve 가족, 부모, 자식이라고 문제에 나..
PS/Problem_Solving 2020. 8. 11. 00:22
[BOJ] 5014. 스타트링크(BFS).java

#. Problemhttps://www.acmicpc.net/problem/5014* 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 #. Solve 그냥 단순하게 생각하면위로 올라갔다..
PS/Problem_Solving 2020. 8. 10. 00:31
1 ··· 12 13 14 15 16 17 18 ··· 39
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more