![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/diXmQY/btrfhdZoXIs/MBxmVQMue8O9Kh9X9Ee7y0/img.jpg)
#. 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..
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/bXpydA/btrfhkxc0zh/uY39SFDKr0kmt7vR1ksa31/img.jpg)
#. 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,..
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/bad3x1/btrfdYBS73T/Td5dqYCfmaS3PFIwVkKdL0/img.jpg)
#. 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이니까.. 배려심이 좋은 문제다. 각..
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/bEVfUc/btreh2KrRBF/jMRCJxgJLV1VhtQEHkTPkK/img.png)
#. 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
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/lELOl/btrduVmAHK1/NhpMD7wFZX6AZuZD24ZPkK/img.png)
#. 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
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/dbcBs3/btrc6RKrCfh/8uOrvDop0IWgVWHlfuZw4k/img.png)
#. 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..
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/bD5L0n/btq150SjxGX/P6hRrEjHelYqY9oBP3P6mK/img.jpg)
#. 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 예외 처리해줘야 하는 부분이 있어서 생각보다 까다로웠다. 그리디 문제는..
![](http://i1.daumcdn.net/thumb/C148x148/?fname=https://blog.kakaocdn.net/dn/yHMIZ/btq16hTYHCd/54xr7mX8lEMCQRiBYDRAFK/img.jpg)
#. 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보다 작거나 같은 자연수"라고..