[BOJ] 5913. Grazing Patterns (bruteforce)
#. Problem https://www.acmicpc.net/problem/5913 * 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 정보 - 5x5 크기의 땅 - Bessie와 Mildre..
[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] 20652. Stuck in a Rut (simulation)
#. Problem https://www.acmicpc.net/problem/20652 * 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] 1744. 수 묶기(그리디).java
#. Problem www.acmicpc.net/problem/1744 * 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 예외 처리해줘야 하는 부분이 있어서 생각보다 까다로웠다. 그리디 문제는..
[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보다 작거나 같은 자연수"라고..