完全数计算

def solve(n):
    n = int(n)
    count = 0
    for i in range(2, n + 1):
        s = 1
        for j in range(2, int(i ** 0.5) + 1):
            if i % j == 0:
                s += j + i // j
        if s == i:
            count += 1
    print(count)