题解 | #完全数计算#
完全数计算
https://www.nowcoder.com/practice/7299c12e6abb437c87ad3e712383ff84
def findfactor(n:int):
l = []
for i in range(1,n//2+1):
if n%i ==0:
l.append(i)
return l
while True:
try:
n = int(input())
count=0
for i in range(1,n):
l = sum(findfactor(i))
if i==l:
count += 1
print(count)
except:
break
查看20道真题和解析