[BOJ] 5884. Three Lines (bruteforce)
#. Problem https://www.acmicpc.net/problem/5884 * The copyright in this matter is in acmicpc #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve - 최대 세 개의 감시 카메라로 N(1 ≤ N ≤ 50,..
[BOJ] 21235. Year of the Cow (문자열)
#. Problem https://www.acmicpc.net/problem/21235 * The copyright in this matter is in acmicpc #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve N 은 최대 100이니까.. 배려심이 좋은 문제다. 각..
[BOJ] 21237. Clockwise Fence (greedy)
#. Problem https://www.acmicpc.net/problem/21237 * The copyright in this matter is in acmicpc #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve ㅇ 범위 - 1
[BOJ] 20647. Cowntagion (Graph)
#. Problem https://www.acmicpc.net/problem/20647 * The copyright in this matter is in acmicpc #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve 농장 : 1 ~ N^5 길 : 1 ~ N-1 이벤트 1..
[BOJ] 1783. 병든 나이트(그리디).java
#. Problem www.acmicpc.net/problem/1783 * The copyright in this matter is in acmicpc #. Resolution Process Read and understand problem Redefine the problem + abstract Create solution plan (select Algorithm, Data structure) Prove the plan (check performance time and usage memory) Carry out the plan Look back on the plan and find a way to improve it #. Solve 우선 N과 M은 "2,000,000,000보다 작거나 같은 자연수"라고..
[BOJ] 4991. 로봇 청소기(BFS, 순열)
#. Problemhttps://www.acmicpc.net/problem/4991* 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 문제 길이에 비해 많은 생각이 필요..
[BOJ] 17142. 연구소 3(BFS).java
#. Problemhttps://www.acmicpc.net/problem/17142* 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 코로나 시대..문제처럼 바이러스가..
[BOJ] 3197. 백조의 호수(BFS).java
#. Problemhttps://www.acmicpc.net/problem/3197* 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 문제를 풀면서 백조의 호수 BMG이..