[SWEA 5643, BOJ 2458] 키 순서(Graph).java
#. Problemhttps://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXQsLWKd5cDFAUo* The copyright in this matter is in SWEA 백준의 2458 문제와 동일하다.https://www.acmicpc.net/problem/2458 #. 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..
[BOJ] 1976.여행 가자(Union&Find).java
#. Problemhttps://www.acmicpc.net/problem/1976* 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] 20040.사이클 게임(Union,Find).java
#. Problemhttps://www.acmicpc.net/problem/20040* 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 간선을 하나씩 그어보면서그래프에 ..
[R 시각화] 히스토그램 그래프 그리기 - histogram plot
히스토그램 그래프 그리기 hist() : 히스토그램 그래프 그리기 (도수분포표 자동 계산 후 히스토그램 출력) hist(x, # 벡터 breaks = "Sturges", # 구간의 분기를 나타내는 벡터 include.lowest = TRUE, # 최소값의 포함 여부 right = TRUE) # 오른쪽 닫힘 여부, # left closed : 오른쪽 포함 (right = TRUE) 설정 시 x 초과 y 이하 구간으로 설정) # right closed : 왼쪽 포함 (right = FALSE 설정 시 x 이상 y 미만 구간으로 설정) col = NULL, # 히스토그램 color border = NULL, # 히스토그램 테두리 color main = paste("Histogram of" , xname), #..