[BOJ] 18809.Gaaaaaaaaaarden(부분집합, BFS)

#. Problemhttps://www.acmicpc.net/problem/18809* 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 부분집합과 BFS로 풀리는 문제다..
PS/Problem_Solving 2020. 9. 11. 23:24
[BOJ] 17070.파이프 옮기기 1(DFS).java

#. Problemhttps://www.acmicpc.net/problem/17070* 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. 9. 00:39
[SWEA] 2105.디저트 카페.java

#. Problemhttps://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5VwAr6APYDFAWu&categoryId=AV5VwAr6APYDFAWu&categoryType=CODE* 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..
PS/Problem_Solving 2020. 9. 7. 21:51
[BOJ] 17472.다리 만들기 2(백트래킹, BFS).java

#. Problemhttps://www.acmicpc.net/problem/17472* 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. 7. 16:39
[BOJ] 17136.색종이 붙이기(백트래킹, 시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/17136* 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. 7. 16:12
[BOJ] 17471.게리맨더링(부분집합, BFS).java

#. Problemhttps://www.acmicpc.net/problem/17471* 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. 7. 15:37
[BOJ] 17779.게리맨더링2(시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/17779* 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. 3. 22:33
[BOJ] 3184.양(DFS,BFS).java

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