[BOJ] 1987.알파벳(DFS,백트래킹).java

#. Problem https://www.acmicpc.net/problem/1987 * 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. 27. 21:06
[BOJ] 3109.빵집(DFS,백트래킹,그리디).java

#. Problemhttps://www.acmicpc.net/problem/3109* 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. 27. 16:38
[BOJ] 1194.달이 차오른다, 가자(BFS, BitMask).java

#. Problemhttps://www.acmicpc.net/problem/1194* 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. 26. 20:47
[BOJ] 14442.벽 부수고 이동하기 2(BFS).java

#. Problemhttps://www.acmicpc.net/problem/14442* 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 문제의 확..
PS/Problem_Solving 2020. 8. 26. 12:58
[BOJ] 2206.벽 부수고 이동하기(BFS).java

#. Problemhttps://www.acmicpc.net/problem/2206* 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. 맵을 이동하면서 좌표와 벽을 ..
PS/Problem_Solving 2020. 8. 26. 10:52
[BOJ] 15686. 치킨 배달(조합).java

#. Problemhttps://www.acmicpc.net/problem/15686* 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. ..
PS/Problem_Solving 2020. 8. 25. 21:47
[BOJ] 10972. 다음 순열(NextPermutation).java

#. Problemhttps://www.acmicpc.net/problem/10972* 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 NextPermutation 을 ..
PS/Problem_Solving 2020. 8. 25. 14:12
[BOJ] 18808. 스티커 붙이기(시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/18808* 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. 20. 23:33
1 ··· 11 12 13 14 15 16 17 ··· 39
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more