連載目次 def prime_factorization(n): result = [] rng = [2] + list(range(3, int(n ** 0.5) + 1, 2)) for i in rng: while n % i == 0: n //= i result.append(i) if n == 1: # これ以上の素数はない break if n > 1: # nは素因数 r …
連載目次 def prime_factorization(n): result = [] rng = [2] + list(range(3, int(n ** 0.5) + 1, 2)) for i in rng: while n % i == 0: n //= i result.append(i) if n == 1: # これ以上の素数はない break if n > 1: # nは素因数 r …