#. Problemhttps://www.acmicpc.net/problem/20159* 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/14465https://www.acmicpc.net/problem/14465* 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 i..
#. Problemhttps://www.acmicpc.net/problem/2167* 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최대 배열의 크기는 300x300 =..
수학, 통계 메서드 Numpy의 수학, 통계 메서드는 모두 axis(축) 지정이 가능합니다. # .sum : 합np.sum?np.sum( ['a', 'axis=None', 'dtype=None', 'out=None', 'keepdims=', 'initial='],) # axis = 축 지정, dtype = 데이터 타입, keepdims = 차원 유지 여부arr = np.arange(10).reshape(2,5)array([[0, 1, 2, 3, 4], [5, 6, 7, 8, 9]])arr.sum()45 # 모든 원소의 합arr3.sum(axis=0) array([ 5, 7, 9, 11, 13]) # 서로 다른 행별(세로) 합arr.sum(axis=1, keepdims = True)array([[10], ..