题解 | #完全数计算#
完全数计算
http://www.nowcoder.com/practice/7299c12e6abb437c87ad3e712383ff84
def check_perfect(n): m = 0 for i in range(1,n): if n % i == 0: m += i return m
while True: try: s = int(input()) c = 0 for i in range(2, s+1): if i == check_perfect(i): c += 1 print(c) except: break
