[BOJ] 2193. 이친수(DP 기초)
#. Problemhttps://www.acmicpc.net/problem/2193* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 0과 1로만 이루어진 수를 이진수라 한다. 이러한 이진수 중 특별한 성질을 갖는 것들이 있는데, 이들을 이친수(pinary number)라 한다. 이친수는 다음의 성질을 만족한다.- 이친수는 0으로 시작하지 않는다.- 이친수에서는 1이 두 번 연속으로 나타나지 않는다. 즉, 11을 부분 문자열로 갖지 않는다. 3. Create solution plan (select Algorithm, Data ..
[BOJ] 11057. 오르막 수(DP 기초)
#. Problemhttps://www.acmicpc.net/problem/11057* 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] 10844. 쉬운 계단 수(DP 기초)
#. Problemhttps://www.acmicpc.net/problem/10844* 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 #. Solve1. DP idx 정의- dp[i]..
#. Problemhttps://www.acmicpc.net/problem/9095* 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 #. Solve1. DP idx 정의- dp[i]는..
#. 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이전 문제와 유사한 문제이다. 마찬..
#. 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생각보다 엄청(?) 단순한 점화식이..
#. 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..
[BOJ] 11066. 파일합치기(DP).py,.cpp
#. Problemhttps://www.acmicpc.net/problem/11066* 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 #. SolveDP의 가장 어려운 유형의 문제이 ..