leetcode-algorithms/python/check_perfect_number.py at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
class Solution:
    def checkPerfectNumber(self, num: int) -> bool:
        if num == 1: return False

        divisior_sum, divisior = 0, 1
        while divisior * divisior <= num:
            if num % divisior == 0:
                divisior_sum += (divisior + num // divisior)
            divisior += 1
        return divisior_sum == num