oj.uz

Submission #785373

# Submission time Handle Problem Language Result Execution time Memory
785373 2023-07-17T08:45:42 Z beaconmc Toys (CEOI18_toy) PyPy 3
0 / 100
 49 ms 20132 KB 
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.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 20132 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 20132 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 20132 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 20132 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 20132 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -