#. Problemhttps://www.acmicpc.net/problem/2116* 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 요리조리 돌려봐야하는 주사위 문제보..
#. Series 1https://www.acmicpc.net/problem/11053* The copyright in this matter is in BOJ #. Solve 나무위키에 LIS의 자세한 설명이 기록되어있다(링크) #. Code 12345678910111213141516171819202122232425262728293031323334353637383940414243import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer; public class BOJ11053 { public static void main(String[] args..
#. Problemhttps://www.acmicpc.net/problem/1938* 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 통나무를 열심히 옮겨보는 BFS +..
#. Problemhttps://www.acmicpc.net/problem/2096* 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/1149* 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 문제의 규칙은 3개지만결국엔 나와 ..
[BOJ] 11052. 카드 구매하기(DP)
#. Problemhttps://www.acmicpc.net/problem/11052* 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 DP[i][j] 는 구매하려고 하..
[BOJ] 2011. 암호코드(DP)
#. Problemhttps://www.acmicpc.net/problem/2011* 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주어진 예제를 뜯어보자..!25114..
[BOJ] 2225. 합분해(DP)
#. Problemhttps://www.acmicpc.net/problem/2225* The copyright in this matter is in BOJ 0부터 N까지의 정수 K개를 더해서 그 합이 N이 되는 경우의 수를 구하는 프로그램을 작성하시오. 덧셈의 순서가 바뀐 경우는 다른 경우로 센다(1+2와 2+1은 서로 다른 경우). 또한 한 개의 수를 여러 번 쓸 수도 있다. #. 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 t..