35 lines
633 B
Python
35 lines
633 B
Python
|
def factorize(n):
|
||
|
|
factors = {}
|
||
|
|
d = 2
|
||
|
|
while n > 1:
|
||
|
|
power = 0
|
||
|
|
while n % d == 0:
|
||
|
|
power += 1
|
||
|
|
n //= d
|
||
|
|
if power > 0:
|
||
|
|
factors[d] = power
|
||
|
|
d += 1
|
||
|
|
if d * d > n:
|
||
|
|
d = n
|
||
|
|
return factors
|
||
|
|
|
||
|
|
|
||
|
|
def get_all_divisors(n):
|
||
|
|
divisors = []
|
||
|
|
d = 1
|
||
|
|
while d * d <= n:
|
||
|
|
if n % d == 0:
|
||
|
|
divisors.append(d)
|
||
|
|
if d * d != n:
|
||
|
|
divisors.append(n // d)
|
||
|
|
d += 1
|
||
|
|
return sorted(divisors)
|
||
|
|
|
||
|
|
|
||
|
|
def test():
|
||
|
|
assert factorize(24) == {2: 3, 3: 1}
|
||
|
|
assert get_all_divisors(16) == [1, 2, 4, 8, 16]
|
||
|
|
|
||
|
|
|
||
|
|
test()
|