题解 | 完全数计算

def find_perfect_count(n):
    if n < 6:
        return 0
    
    cnt = 0
    for num in range(2,n + 1):
        result = 1
        for i in range(2,int (num**0.5)+1):
            if num % i == 0:
                result += i
                res = num // i
                if num != i:
                    result += res
        if result == num:
            cnt += 1
    return cnt

k = int (input())
print(find_perfect_count(k))