Programmers - 약수의 합

resilient

·

2020. 7. 23. 21:50

728x90
반응형

def solution(n):
    answer = 0
    for i in range(n):
        if i>0:
            if n%i==0:
                answer+=i
    answer += n
    return answer

------------------------------------------------------------------------------------------

def solution(num):

return num + sum([i for i in range(1, (num // 2) + 1) if num % i == 0])

반응형