[백준 알고리즘] 2108번 통계학 (Python)

<Python>

import sys
from collections import Counter

n = int(sys.stdin.readline())
num_list = []

for _ in range(n):
    num_list.append(int(sys.stdin.readline()))

num_list.sort()
print(round(sum(num_list) / n))  # 산술평균
print(num_list[len(num_list) // 2])  # 중앙값
if len(num_list)>1:
    c = Counter(num_list).most_common(2) # 빈도수
    print(c[1][0] if c[0][1] == c[1][1] else c[0][0])
else:
    print(num_list[0])
print(num_list[-1] - num_list[0])  # 범위

▼ 링크

https://www.acmicpc.net/problem/2108

2108번: 통계학