[BOJ] 1697.숨바꼭질(BFS).java

#. Problemhttps://www.acmicpc.net/problem/1697* 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. 8. 23:22
[BOJ] 2178. 미로 탐색(BFS, DP).java

#. Problemhttps://www.acmicpc.net/problem/2178* 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. 8. 22:57
[BOJ] 7569. 토마토(BFS).java

#. Problemhttps://www.acmicpc.net/problem/7569* 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 7576. 토마토 문제의 상위(?)..
PS/Problem_Solving 2020. 8. 8. 22:45
[BOJ] 2309. 일곱 난쟁이(조합 기본).java

#. Problemhttps://www.acmicpc.net/problem/2309* 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. 8. 22:26
[BOJ] 15652. N과 M(4)(중복조합 기본).java

#. Problemhttps://www.acmicpc.net/problem/15652* 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 N개의 자연수 중에서 M개를 고른..
PS/Problem_Solving 2020. 8. 8. 22:15
[BOJ] 15651. N과 M(3)(중복순열 기본).java

#. Problemhttps://www.acmicpc.net/problem/15651* 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 N개의 자연수 중 M개를 고른 수..
PS/Problem_Solving 2020. 8. 8. 22:03
[BOJ] 15650. N과 M(2)(조합 기본).java

#. Problemhttps://www.acmicpc.net/problem/15650* 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 이 문제는 N개의 자연수 중에서 ..
PS/Problem_Solving 2020. 8. 8. 21:45
[BOJ] 15649. N과 M(1)(순열 기본).java

#. Problemhttps://www.acmicpc.net/problem/15649* 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 이 문제는 N개의 자연수 중 중복..
PS/Problem_Solving 2020. 8. 8. 21:09
1 ··· 13 14 15 16 17 18 19 ··· 39
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more