[B2108][통계학][python]

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

---

import sys
from collections import Counter

n = int(sys.stdin.readline())
arr = [int(sys.stdin.readline()) for _ in range(n)]

def mean(num):
    return round(sum(num)/len(num))
def median(num):
    num.sort()
    return num[len(num)//2]
def mode(num):
    mode_dict = Counter(num)  # 딕셔너리로 데이터 등장 횟수 저장
    m = mode_dict.most_common()  # 등장한 횟수를 내림차순으로 정리
    if len(num) > 1:
        if m[0][1] == m[1][1]:
            mod = m[1][0]
        else:
            mod = m[0][0]
    else:
        mod = m[0][0]
    return mod
def scope(num):
    return max(num) - min(num)

print(mean(arr))
print(median(arr))
print(mode(arr))
print(scope(arr))