Submission #785373

#	Time	Username	Problem	Language	Result	Execution time	Memory
785373		beaconmc	Toys (CEOI18_toy)	Pypy 3	0 / 100	49 ms	20132 KiB

toy

from math import sqrt
n = int(input())

divs = []
for i in range(2, floor(sqrt(n))+1):
    if n%i==0:
        divs.append(i)
        if i != n//i:
            divs.append(n//i)
divs.sort()
divs.append(n)

sus = [set() for i in range(n+1)]

sus[1].add(0)

for i in range(1,n+1):
    for j in divs:
        if n%(i*j): continue
        for k in sus[i]:
            sus[i*j].add(k+j-1)
print(len(sus[-1]))
print(" ".join(map(str, sorted(list(sus[-1])))))

• Subtask 1: 0 / 19
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 21