[BOJ] 16769. Mixing Milk.py

#. Problem https://www.acmicpc.net/problem/16769* 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 #. Python12345678..
PS/Problem_Solving 2020. 5. 18. 12:09
[BOJ] 9037. The candy war.py.cpp

#. Problem https://www.acmicpc.net/problem/9037* 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 th..
PS/Problem_Solving 2020. 5. 17. 20:01
[BOJ] 17224. APC는 왜 서브태스크 대회가 되었을까?.py

#. Problem https://www.acmicpc.net/problem/17224* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- L(역량)보다 작거나 같은 난이도 문제를 풀 수 있음- K(풀 수 있는 문제 개수)개보다 많은 문제는 해결할 수 없음- 쉬운 버전의 문제를 해결한다면 100점을 얻고, 어려운 버전을 해결한다면 140점을 얻음- 어려운 버전을 해결하면 쉬운 버전도 같이 풀리는 것 3. Create solution plan (select Algorithm, Data structure) 4. Prove the p..
PS/Problem_Solving 2020. 5. 15. 21:42
[BOJ] 16165. 걸그룹 마스터 준석이

#. Problem https://www.acmicpc.net/problem/16165* 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 #. SolveDictionary 자료구조를 사..
PS/Problem_Solving 2020. 5. 15. 20:50
[BOJ] 1920. 수 찾기.py

#. Problem https://www.acmicpc.net/problem/1920* 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 #. Code12345678910..
PS/Problem_Solving 2020. 5. 15. 20:11
[BOJ] 17389. 보너스 점수.py

#. Problemhttps://www.acmicpc.net/problem/17389* 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 #. Codeㅇ Python123456789101..
PS/Problem_Solving 2020. 5. 15. 15:24
[BOJ] 17269 이름궁합 테스트.py (문자열)

#. Problemhttps://www.acmicpc.net/problem/17269* 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. 두 사람의 이름을 한 글자씩 ..
PS/Problem_Solving 2020. 5. 15. 14:54
[BOJ] 17614번. 369

#. Problem https://www.acmicpc.net/problem/17614* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 1 이상의 정수 N에 대하여 369 게임을 N까지 규칙을 지키며 진행된다면 그때까지 듣게 되는 박수의 총 횟수 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) - N 은 1 N; do { int temp = i; while (t..
PS/Problem_Solving 2020. 4. 19. 01:53
1 ··· 19 20 21 22 23
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more