题解 | #完全数计算#
完全数计算
https://www.nowcoder.com/practice/7299c12e6abb437c87ad3e712383ff84?tpId=37&tqId=21279&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D2%26tpId%3D37%26type%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=
import sys
n = int(input())
def divisor(n):
L=[]
for i in range(1,n):
if n%i ==0:
L.append(i)
return L
def iscompletenumber(n):
L2=[]
for i in range(1,n):
if sum(divisor(i))==i:
L2.append(i)
print(len(L2))
return L2
iscompletenumber(n)
