cpl/math/prime_factorization.py

View this file on GitHub
Last update: 1970-01-01 00:00:00+00:00

Code

from typing import List


def factorize(n: int) -> List[int]:
    """Prime factorization
    Factorize integer `n` with time complexity O(sqrt(n))

    Args:
        n: Integer to factorize.

    Returns:
        List of prime factors of `n`.

    """
    res: List[int] = []
    for i in range(2, int(n ** 0.5) + 1):
        while n % i == 0:
            res.append(i)
            n //= i
    if n > 1:
        return res + [n]
    else:
        return res

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.9.2/x64/lib/python3.9/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
  File "/opt/hostedtoolcache/Python/3.9.2/x64/lib/python3.9/site-packages/onlinejudge_verify/languages/python.py", line 96, in bundle
    raise NotImplementedError
NotImplementedError