[BOJ] 15651. N과 M(3)(중복순열 기본).java

#. Problemhttps://www.acmicpc.net/problem/15651* 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 N개의 자연수 중 M개를 고른 수..
PS/Problem_Solving 2020. 8. 8. 22:03
[BOJ] 15650. N과 M(2)(조합 기본).java

#. Problemhttps://www.acmicpc.net/problem/15650* 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 이 문제는 N개의 자연수 중에서 ..
PS/Problem_Solving 2020. 8. 8. 21:45
[BOJ] 15649. N과 M(1)(순열 기본).java

#. Problemhttps://www.acmicpc.net/problem/15649* 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 이 문제는 N개의 자연수 중 중복..
PS/Problem_Solving 2020. 8. 8. 21:09
[BOJ] 2164. 카드2(Queue).java

#. Problemhttps://www.acmicpc.net/problem/2164* 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 Queue를 사용하면 단순하게(?)..
PS/Problem_Solving 2020. 8. 8. 20:57
[BOJ] 5568. 카드 놓기(조합).java

#. Problemhttps://www.acmicpc.net/problem/5568* 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 조합을 적용해야하는 문제이다.N개의..
PS/Problem_Solving 2020. 8. 8. 20:47
[BOJ] 1931.회의실배정.java

#. Problemhttps://www.acmicpc.net/problem/1931* 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. 8. 7. 15:28
[BOJ] 10026.적록색약.java

#. Problemhttps://www.acmicpc.net/problem/10026* 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. 8. 7. 15:23
[BOJ] 1068.트리.java

#. Problemhttps://www.acmicpc.net/problem/1068* 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. 8. 7. 09:29
1 ··· 24 25 26 27 28 29 30 ··· 34
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more