[BOJ] 11727. 2xn 타일링 2(DP 기초)

#. Problemhttps://www.acmicpc.net/problem/11727* 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. 6. 10. 18:37
[BOJ] 11726. 2xn 타일링(DP 기초)

#. Problemhttps://www.acmicpc.net/problem/11726* 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. 6. 10. 18:09
[BOJ] 1463. 1로 만들기(DP 기초)

#. Problemhttps://www.acmicpc.net/problem/1463* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 정수 X에 사용할 수 있는 연산 ㄴ if(X%3==0) X /= 3; ㄴ if(X%2==0) X /= 2; ㄴ X -= 1; - 정수 N이 주어졌을 때, 위와 같은 연산 세 개를 적절히 사용하여 1을 만들 수 있는 최소 횟수 3. Create solution plan (select Algorithm, Data structure) - DP(Dynamic Programming) 4. Prove t..
PS/Problem_Solving 2020. 6. 10. 17:40
[BOJ] 2014. 소수의 곱(Greedy, 탐욕 + 우선순위 큐(힙)).py

#. 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 문제에서 가장(?)어려운..
PS/Problem_Solving 2020. 6. 9. 16:47
[BOJ] 1080. 행렬(Greedy, 탐욕 기초)

#. 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..
PS/Problem_Solving 2020. 6. 9. 15:10
[BOJ] 2437. 저울(Greedy, 탐욕 기초)

#. 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그리디는 최적의 상태가 존재하는지, ..
PS/Problem_Solving 2020. 6. 8. 21:46
[BOJ] 16676. 근우의 다이어리 꾸미기(Greedy, 탐욕 기초).py

#. 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까지는 스티커 팩 하나로 모..
PS/Problem_Solving 2020. 6. 8. 17:34
[BOJ] 1439. 뒤집기(Greedy, 탐욕 기초).py

#. Problemhttps://www.acmicpc.net/problem/1439* 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. 6. 8. 16:58
1 ··· 19 20 21 22 23 24 25 ··· 39
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more