https://programmers.co.kr/learn/courses/30/lessons/12928
def solution(n):
answer = 0
for i in range(1, n+1):
if n%i==0:
answer+=i
return answer
def sumDivisor(num):
return num + sum([i for i in range(1, (num//2) + 1) if num % i == 0])
def getMyDivisor(n):
divisorsList = []
for i in range(1, int(n**(1/2)) + 1):
if (n % i == 0):
divisorsList.append(i)
if ( (i**2) != n) :
divisorsList.append(n // i)
divisorsList.sort()
return divisorsList