Untitled

def prime_factorization_count(n):
    count = 0
    i = 2
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            count += 1
    if n > 1:
        count += 1
    return count

def find_optimal_cubes():
    max_divisors = 0
    optimal_cubes = 0

    for n in range(1, 51):
        divisors = prime_factorization_count(n)

        if divisors > max_divisors:
            max_divisors = divisors
            optimal_cubes = n

    return optimal_cubes, max_divisors

optimal_cubes, max_divisors = find_optimal_cubes()
print(f"Det optimale antal centicubes er {optimal_cubes}, og det giver mulighed for at bygge et rektangel med {max_divisors} forskellige dimensioner.")