[BOJ] 미로 탈출하기(DFS + DP).java

#. Problemhttps://www.acmicpc.net/problem/17090* 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. 12. 30. 20:03
[BOJ] 20159. 동작 그만. 밑장 빼기냐?(DP).java

#. Problemhttps://www.acmicpc.net/problem/20159* 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. 12. 2. 12:12
[BOJ] 소가 길을 건너간 이유 Series.java

소가 길을 건너간 이유 6 을 풀고,문제가 너무 재미있어서나도 소가 길을 건너간 이유를 연구해보려고 한다. 일명.. Cow R&D..... #. Series 1https://www.acmicpc.net/problem/14467* The copyright in this matter is in BOJ #. Solve Cow R&D 에 온 걸 환영하는 문제다. 먼저 소가 길을 건너는 것을 관찰하면서처음 확인하는 소라면 위치를 체크해두고이미 확인했던 소라면 길을 건넜는지 확인해주자. #. Code 1234567891011121314151617181920212223242526272829303132333435363738394041import java.io.BufferedReader;import java.io.IOE..
PS/Problem_Solving 2020. 10. 3. 20:52
[BOJ] 14466.소가 길을 건너간 이유 6(DFS, BFS).java

#. Problemhttps://www.acmicpc.net/problem/14466* 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. 10. 3. 18:45
[BOJ] 19952.인성 문제 있어??(BFS).java

#. Problemhttps://www.acmicpc.net/problem/19952* 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 범위는 2 ≤ H, W ≤ 100..
PS/Problem_Solving 2020. 10. 2. 19:12
[BOJ] 2147.로봇 시뮬레이션(시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/2174* 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. 10. 1. 21:13
[BOJ] 1197.최소 스패닝 트리(MST, prim, kruskal).java

#. Problemhttps://www.acmicpc.net/problem/1197* 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. 10. 1. 13:56
[BOJ] 4811. 알약(DP).java

#. Problemhttps://www.acmicpc.net/problem/4811* 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. 9. 27. 22:10
1 2 3 4 ··· 7
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more