[Inflearn] 네트워크 선 자르기(DP기초 : Bottom-Up)

#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 1m, 2m의 길이를 갖는 선으로 네트워크 선을 자르기 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 ..
PS/Problem_Solving 2020. 5. 27. 20:56
[BOJ] 17406. 배열 돌리기 4.py

#. Problem https://www.acmicpc.net/problem/17406* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 회전 연산은 세 정수 (r, c, s)- 가장 왼쪽 윗 칸이 (r-s, c-s), 가장 오른쪽 아랫 칸이 (r+s, c+s)인 정사각형을 시계 방향으로 한 칸씩 돌린다- 회전 연산은 모두 한 번씩 사용해야 하며, 순서는 임의로 정해도 된다. 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check p..
PS/Problem_Solving 2020. 5. 27. 18:28
[BOJ] 2048. Easy.py.cpp (brute force)

#. Problemhttps://www.acmicpc.net/problem/12100* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 최대 5번 이동시켜서 얻을 수 있는 가장 큰 블록 출력 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 improv..
PS/Problem_Solving 2020. 5. 27. 14:06
[BOJ] 16768. Mooyo Mooyo.py(Blood Field)

#. Problem https://www.acmicpc.net/problem/16768* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 같은 색상이면 0으로 변경- 하강하여 0으로 된 결과 셀을 채울 수 있음 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 wa..
PS/Problem_Solving 2020. 5. 27. 01:03
[BOJ] 1012. 유기농 배추,py(BFS, DFS, Flood Fill)

#. Problemhttps://www.acmicpc.net/problem/1012* 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. 5. 24. 01:50
[BOJ] 14620. 꽃길.py.cpp(전수조사)

#. Problemhttps://www.acmicpc.net/problem/14620* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 1년 후 꽃이 핌- 꽃 씨앗이 세개밖에- 다른 꽃잎과 닿게 될 경우 두 꽃 다 죽음- 화단 밖으로 꽃잎이 나가도 죽음 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory)- 최대 N은 10, N*N을 세 개의 꽃이 탐색해야하므로, (10..
PS/Problem_Solving 2020. 5. 19. 22:13
[BOJ] 16956. 늑대와 양.py(방향벡터)

#. Problemhttps://www.acmicpc.net/problem/16956* 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. 5. 19. 20:15
[BOJ] 17413. 단어 뒤집기 2.py (조건문 구현)

#. Problem https://www.acmicpc.net/problem/17413* 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 #. Code1234567891011121314..
PS/Problem_Solving 2020. 5. 19. 14:32
1 ··· 22 23 24 25 26 27 28 ··· 39
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more