题解 | #完全数计算#

def is_perfect_number(n):
    sum_p_divison: int = 0
    for i in range(1, n // 2 + 1):
        if n % i == 0:
            sum_p_divison += i
    if sum_p_divison == n:
        return True
    else:
        return False


# print(is_perfect_number(27))
# print(is_perfect_number(28))
count: int = 0
for i in range(1, int(input()) + 1, 1):
    if is_perfect_number(i):
        # print(i)
        count += 1
print(count)

自测超时了。