Submission #10087007

---

Source Code Expand

n = int(input())

prime_factors = []

def is_prime(n):
    sqrt_n = n ** 0.5
    if n == 0 or n == 1:
        return False
    if n == 2:
        return True
    i = 2
    while i < sqrt_n:
        if n % i == 0:
            return False
        i += 1
    return True


prime_factors = []
original = n
if is_prime(n):
    prime_factors.append(n)
else:
    i = 2
    while n > 1 and i <= original:
        if n % i == 0:
            prime_factors.append(i)
            n //= i
        else:
            i += 1

def myfunc(a, b):
    if len(str(a)) > len(str(b)):
        return len(str(a))
    return len(str(b))

nums = []
t = 1
MIN = len(str(original))
for p in prime_factors:
    original //= p
    nums.append((original, p * t))
    MIN = min(MIN, myfunc(original, p * t))
    t *= p
print(MIN)

Submission Info

Judge Result