[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] 1759. 암호 만들기(조합).java
#. Problemhttps://www.acmicpc.net/problem/1759* 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] 5002. 도어맨(Greedy, 문자열).java
#. Problemhttps://www.acmicpc.net/problem/5002* 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 문제의 핵심은줄을 서 있는 순서와 ..
#. Problemhttps://www.acmicpc.net/problem/1931* 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 종료시간 기준으로 정렬하는게 제일 ..
#. Problemhttps://www.acmicpc.net/problem/2014* 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 #. SolveGreedy 문제에서 가장(?)어려운..
#. Problemhttps://www.acmicpc.net/problem/1080* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 행렬 A를 행렬 B로 바꾸는데 필요한 연산의 횟수의 최솟값- 행렬 변환 연산은 3*3 크기의 부분 행렬에 있는 모든 원소를 뒤집는 것 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Loo..
#. Problemhttps://www.acmicpc.net/problem/2437* 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그리디는 최적의 상태가 존재하는지, ..
#. Problemhttps://www.acmicpc.net/problem/16676* 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 #. Solve0~10까지는 스티커 팩 하나로 모..