Problem:


Score : 400 points

Problem Statement

Given is a positive integer N. Consider repeatedly applying the operation below on N:

First, choose a positive integer z satisfying all of the conditions below:

z can be represented as z=p^e, where p is a prime number and e is a positive integer;

z divides N;

z is different from all integers chosen in previous operations.

Then, replace N with N/z.

Find the maximum number of times the operation can be applied.

Constraints

All values in input are integers.

1 \leq N \leq 10^{12}

Input

Input is given from Standard Input in the following format:

N

Output

Print the maximum number of times the operation can be applied.

Sample Input 1

24

Sample Output 1

3

We can apply the operation three times by, for example, making the following choices:

Choose z=2 (=2^1). (Now we have N=12.)

Choose z=3 (=3^1). (Now we have N=4.)

Choose z=4 (=2^2). (Now we have N=1.)

Sample Input 2

1

Sample Output 2

0

We cannot apply the operation at all.

Sample Input 3

64

Sample Output 3

3

We can apply the operation three times by, for example, making the following choices:

Choose z=2 (=2^1). (Now we have N=32.)

Choose z=4 (=2^2). (Now we have N=8.)

Choose z=8 (=2^3). (Now we have N=1.)

Sample Input 4

1000000007

Sample Output 4

1

We can apply the operation once by, for example, making the following choice:

z=1000000007 (=1000000007^1). (Now we have N=1.)

Sample Input 5

997764507000

Sample Output 5

7



Sample input:
24


Sample output:
3

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
p, score = 2, 0
while p <= N:
  e = 1
  while p ** e <= N:
    # print(p, e, N, score)
    if N % (p ** e):
      break
    else:
      N = N // (p ** e)
      score += 1
      e += 1
      # print('tasu')
      # print(p, e, N, score)
  else:
    p += 1
print(score)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
def prime_dict(n):
    a = {}
    if n%2 == 0:
        a[2] = 1
        n//=2
    while n%2 == 0:
        a[2] += 1
        n //= 2
    f = 3
    while f*f <= n:
        if n%f == 0:
            if f not in a:
                a[f] = 1
            else:
                a[f] += 1
        else:
            f += 2
    if n!= 1:
        a[n] = 1
    return a
primes = prime_dict(N)
ans = 0
for k,v in primes.items():
    now = 1
    while now*(now+1)//2 <= v:
        now += 1
    ans += now-1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import math

#p = "2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049 1051 1061 1063 1069 1087 1091 1093 1097 1103 1109 1117 1123 1129 1151 1153 1163 1171 1181 1187 1193 1201 1213 1217 1223 1229 1231 1237 1249 1259 1277 1279 1283 1289 1291 1297 1301 1303 1307 1319 1321 1327 1361 1367 1373 1381 1399 1409 1423 1427 1429 1433 1439 1447 1451 1453 1459 1471 1481 1483 1487 1489 1493 1499 1511 1523 1531 1543 1549 1553 1559 1567 1571 1579 1583 1597 1601 1607 1609 1613 1619 1621 1627 1637 1657 1663 1667 1669 1693 1697 1699 1709 1721 1723 1733 1741 1747 1753 1759 1777 1783 1787 1789 1801 1811 1823 1831 1847 1861 1867 1871 1873 1877 1879 1889 1901 1907 1913 1931 1933 1949 1951 1973 1979 1987 1993 1997 1999 2003 2011 2017 2027 2029 2039 2053 2063 2069 2081 2083 2087 2089 2099 2111 2113 2129 2131 2137 2141 2143 2153 2161 2179 2203 2207 2213 2221 2237 2239 2243 2251 2267 2269 2273 2281 2287 2293 2297 2309 2311 2333 2339 2341 2347 2351 2357 2371 2377 2381 2383 2389 2393 2399 2411 2417 2423 2437 2441 2447 2459 2467 2473 2477 2503 2521 2531 2539 2543 2549 2551 2557 2579 2591 2593 2609 2617 2621 2633 2647 2657 2659 2663 2671 2677 2683 2687 2689 2693 2699 2707 2711 2713 2719 2729 2731 2741 2749 2753 2767 2777 2789 2791 2797 2801 2803 2819 2833 2837 2843 2851 2857 2861 2879 2887 2897 2903 2909 2917 2927 2939 2953 2957 2963 2969 2971 2999 3001 3011 3019 3023 3037 3041 3049 3061 3067 3079 3083 3089 3109 3119 3121 3137 3163 3167 3169 3181 3187 3191 3203 3209 3217 3221 3229 3251 3253 3257 3259 3271 3299 3301 3307 3313 3319 3323 3329 3331 3343 3347 3359 3361 3371 3373 3389 3391 3407 3413 3433 3449 3457 3461 3463 3467 3469 3491 3499 3511 3517 3527 3529 3533 3539 3541 3547 3557 3559 3571 3581 3583 3593 3607 3613 3617 3623 3631 3637 3643 3659 3671 3673 3677 3691 3697 3701 3709 3719 3727 3733 3739 3761 3767 3769 3779 3793 3797 3803 3821 3823 3833 3847 3851 3853 3863 3877 3881 3889 3907 3911 3917 3919 3923 3929 3931 3943 3947 3967 3989 4001 4003 4007 4013 4019 4021 4027 4049 4051 4057 4073 4079 4091 4093 4099 4111 4127 4129 4133 4139 4153 4157 4159 4177 4201 4211 4217 4219 4229 4231 4241 4243 4253 4259 4261 4271 4273 4283 4289 4297 4327 4337 4339 4349 4357 4363 4373 4391 4397 4409 4421 4423 4441 4447 4451 4457 4463 4481 4483 4493 4507 4513 4517 4519 4523 4547 4549 4561 4567 4583 4591 4597 4603 4621 4637 4639 4643 4649 4651 4657 4663 4673 4679 4691 4703 4721 4723 4729 4733 4751 4759 4783 4787 4789 4793 4799 4801 4813 4817 4831 4861 4871 4877 4889 4903 4909 4919 4931 4933 4937 4943 4951 4957 4967 4969 4973 4987 4993 4999 5003 5009 5011 5021 5023 5039 5051 5059 5077 5081 5087 5099 5101 5107 5113 5119 5147 5153 5167 5171 5179 5189 5197 5209 5227 5231 5233 5237 5261 5273 5279 5281 5297 5303 5309 5323 5333 5347 5351 5381 5387 5393 5399 5407 5413 5417 5419 5431 5437 5441 5443 5449 5471 5477 5479 5483 5501 5503 5507 5519 5521 5527 5531 5557 5563 5569 5573 5581 5591 5623 5639 5641 5647 5651 5653 5657 5659 5669 5683 5689 5693 5701 5711 5717 5737 5741 5743 5749 5779 5783 5791 5801 5807 5813 5821 5827 5839 5843 5849 5851 5857 5861 5867 5869 5879 5881 5897 5903 5923 5927 5939 5953 5981 5987 6007 6011 6029 6037 6043 6047 6053 6067 6073 6079 6089 6091 6101 6113 6121 6131 6133 6143 6151 6163 6173 6197 6199 6203 6211 6217 6221 6229 6247 6257 6263 6269 6271 6277 6287 6299 6301 6311 6317 6323 6329 6337 6343 6353 6359 6361 6367 6373 6379 6389 6397 6421 6427 6449 6451 6469 6473 6481 6491 6521 6529 6547 6551 6553 6563 6569 6571 6577 6581 6599 6607 6619 6637 6653 6659 6661 6673 6679 6689 6691 6701 6703 6709 6719 6733 6737 6761 6763 6779 6781 6791 6793 6803 6823 6827 6829 6833 6841 6857 6863 6869 6871 6883 6899 6907 6911 6917 6947 6949 6959 6961 6967 6971 6977 6983 6991 6997 7001 7013 7019 7027 7039 7043 7057 7069 7079 7103 7109 7121 7127 7129 7151 7159 7177 7187 7193 7207 7211 7213 7219 7229 7237 7243 7247 7253 7283 7297 7307 7309 7321 7331 7333 7349 7351 7369 7393 7411 7417 7433 7451 7457 7459 7477 7481 7487 7489 7499 7507 7517 7523 7529 7537 7541 7547 7549 7559 7561 7573 7577"
#p = map(int,p.split())
memo = []
ans = 0
p = []


# 素数のリスト作成（もらいもの）
def sieve_of_eratosthenes(n): #エラトステネスのふるい
    candidate = list(range(2, n+1)) #候補
    prime = []
    limit = n**0.5 + 1 #+1がないと平方数を素数にしてしまう

    while True:
        p = candidate[0] 
        if limit <= p:
            prime.extend(candidate) #この時点での残っているのは素数
            break
        prime.append(p) #pを素数リストに登録

        candidate = [i for i in candidate if i % p != 0]

    return prime


def isprime(x):
    if x <= 1:
        return False
    
    for i in range(2,math.floor(math.sqrt(x))+1):
        if (x % i) == 0:
            return False
    return True

def z_make(n,p):
    for prime in p:
        for i in range(1,100000000000):
            z = prime ** i
            
            if z >= n:
                break
            
            if not z in memo:
                memo.append(z)

def divGame2(n):
    for z in memo:
        global ans
        if n % z == 0:
            rem = n / z
            memo.remove(z)
            ans += 1
            #print("n=",n," z=",z,"rem=",rem," ans=",ans)
            return divGame2(rem)
        
n = int(input())
p = sieve_of_eratosthenes(320000)
#print(p)

if n in p:
    print(1)
else:
    z_make(n,p)
    memo.sort()
    #print(memo)
    divGame2(n)
    print(ans)

Submission status: Time Limit Exceeded

Solution code:
import math

#p = "2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049 1051 1061 1063 1069 1087 1091 1093 1097 1103 1109 1117 1123 1129 1151 1153 1163 1171 1181 1187 1193 1201 1213 1217 1223 1229 1231 1237 1249 1259 1277 1279 1283 1289 1291 1297 1301 1303 1307 1319 1321 1327 1361 1367 1373 1381 1399 1409 1423 1427 1429 1433 1439 1447 1451 1453 1459 1471 1481 1483 1487 1489 1493 1499 1511 1523 1531 1543 1549 1553 1559 1567 1571 1579 1583 1597 1601 1607 1609 1613 1619 1621 1627 1637 1657 1663 1667 1669 1693 1697 1699 1709 1721 1723 1733 1741 1747 1753 1759 1777 1783 1787 1789 1801 1811 1823 1831 1847 1861 1867 1871 1873 1877 1879 1889 1901 1907 1913 1931 1933 1949 1951 1973 1979 1987 1993 1997 1999 2003 2011 2017 2027 2029 2039 2053 2063 2069 2081 2083 2087 2089 2099 2111 2113 2129 2131 2137 2141 2143 2153 2161 2179 2203 2207 2213 2221 2237 2239 2243 2251 2267 2269 2273 2281 2287 2293 2297 2309 2311 2333 2339 2341 2347 2351 2357 2371 2377 2381 2383 2389 2393 2399 2411 2417 2423 2437 2441 2447 2459 2467 2473 2477 2503 2521 2531 2539 2543 2549 2551 2557 2579 2591 2593 2609 2617 2621 2633 2647 2657 2659 2663 2671 2677 2683 2687 2689 2693 2699 2707 2711 2713 2719 2729 2731 2741 2749 2753 2767 2777 2789 2791 2797 2801 2803 2819 2833 2837 2843 2851 2857 2861 2879 2887 2897 2903 2909 2917 2927 2939 2953 2957 2963 2969 2971 2999 3001 3011 3019 3023 3037 3041 3049 3061 3067 3079 3083 3089 3109 3119 3121 3137 3163 3167 3169 3181 3187 3191 3203 3209 3217 3221 3229 3251 3253 3257 3259 3271 3299 3301 3307 3313 3319 3323 3329 3331 3343 3347 3359 3361 3371 3373 3389 3391 3407 3413 3433 3449 3457 3461 3463 3467 3469 3491 3499 3511 3517 3527 3529 3533 3539 3541 3547 3557 3559 3571 3581 3583 3593 3607 3613 3617 3623 3631 3637 3643 3659 3671 3673 3677 3691 3697 3701 3709 3719 3727 3733 3739 3761 3767 3769 3779 3793 3797 3803 3821 3823 3833 3847 3851 3853 3863 3877 3881 3889 3907 3911 3917 3919 3923 3929 3931 3943 3947 3967 3989 4001 4003 4007 4013 4019 4021 4027 4049 4051 4057 4073 4079 4091 4093 4099 4111 4127 4129 4133 4139 4153 4157 4159 4177 4201 4211 4217 4219 4229 4231 4241 4243 4253 4259 4261 4271 4273 4283 4289 4297 4327 4337 4339 4349 4357 4363 4373 4391 4397 4409 4421 4423 4441 4447 4451 4457 4463 4481 4483 4493 4507 4513 4517 4519 4523 4547 4549 4561 4567 4583 4591 4597 4603 4621 4637 4639 4643 4649 4651 4657 4663 4673 4679 4691 4703 4721 4723 4729 4733 4751 4759 4783 4787 4789 4793 4799 4801 4813 4817 4831 4861 4871 4877 4889 4903 4909 4919 4931 4933 4937 4943 4951 4957 4967 4969 4973 4987 4993 4999 5003 5009 5011 5021 5023 5039 5051 5059 5077 5081 5087 5099 5101 5107 5113 5119 5147 5153 5167 5171 5179 5189 5197 5209 5227 5231 5233 5237 5261 5273 5279 5281 5297 5303 5309 5323 5333 5347 5351 5381 5387 5393 5399 5407 5413 5417 5419 5431 5437 5441 5443 5449 5471 5477 5479 5483 5501 5503 5507 5519 5521 5527 5531 5557 5563 5569 5573 5581 5591 5623 5639 5641 5647 5651 5653 5657 5659 5669 5683 5689 5693 5701 5711 5717 5737 5741 5743 5749 5779 5783 5791 5801 5807 5813 5821 5827 5839 5843 5849 5851 5857 5861 5867 5869 5879 5881 5897 5903 5923 5927 5939 5953 5981 5987 6007 6011 6029 6037 6043 6047 6053 6067 6073 6079 6089 6091 6101 6113 6121 6131 6133 6143 6151 6163 6173 6197 6199 6203 6211 6217 6221 6229 6247 6257 6263 6269 6271 6277 6287 6299 6301 6311 6317 6323 6329 6337 6343 6353 6359 6361 6367 6373 6379 6389 6397 6421 6427 6449 6451 6469 6473 6481 6491 6521 6529 6547 6551 6553 6563 6569 6571 6577 6581 6599 6607 6619 6637 6653 6659 6661 6673 6679 6689 6691 6701 6703 6709 6719 6733 6737 6761 6763 6779 6781 6791 6793 6803 6823 6827 6829 6833 6841 6857 6863 6869 6871 6883 6899 6907 6911 6917 6947 6949 6959 6961 6967 6971 6977 6983 6991 6997 7001 7013 7019 7027 7039 7043 7057 7069 7079 7103 7109 7121 7127 7129 7151 7159 7177 7187 7193 7207 7211 7213 7219 7229 7237 7243 7247 7253 7283 7297 7307 7309 7321 7331 7333 7349 7351 7369 7393 7411 7417 7433 7451 7457 7459 7477 7481 7487 7489 7499 7507 7517 7523 7529 7537 7541 7547 7549 7559 7561 7573 7577"
#p = map(int,p.split())
memo = []
ans = 0
p = []


# https://qiita.com/trami/items/d59dcb914c991e5a62c9
def sieve_of_eratosthenes(n): #エラトステネスのふるい
    candidate = list(range(2, n+1)) #候補
    prime = []
    limit = n**0.5 + 1 #+1がないと平方数を素数にしてしまう

    while True:
        p = candidate[0] 
        if limit <= p:
            prime.extend(candidate) #この時点での残っているのは素数
            break
        prime.append(p) #pを素数リストに登録

        candidate = [i for i in candidate if i % p != 0]

    return prime


def isprime(x):
    if x <= 1:
        return False
    
    for i in range(2,math.floor(math.sqrt(x))+1):
        if (x % i) == 0:
            return False
    return True

def z_make(n,p):
    for prime in p:
        for i in range(1,100000000000):
            z = prime ** i
            
            if z >= n:
                break
            
            if not z in memo:
                memo.append(z)

def divGame2(n):
    for z in memo:
        global ans
        if n % z == 0:
            rem = n / z
            memo.remove(z)
            ans += 1
            #print("n=",n," z=",z,"rem=",rem," ans=",ans)
            return divGame2(rem)
        
n = int(input())
p = sieve_of_eratosthenes(320000)
#print(p)

if isprime(n):
    print(1)
else:
    z_make(n,p)
    memo.sort()
    #print(memo)
    divGame2(n)
    print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
p = []
n2 = n
# for i in range(2,int(n2**0.5//1 + 1)):
for i in range(2,n):
  index = 0
  while n2%i == 0:
    index+=1
    n2 = n2//i
  if index != 0:
    p.append(index)
  else:
    continue
count = 0
t = 1

if n == 1:
  print(0)
elif not p:
  print(1)
else:
  for i in range(len(p)):
    while p[i] - t >= 0:
      p[i]-=t
      count+=1
      t+=1
    t = 1
  print(count)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

count = 0
for z in range(2,N+1):
    if N % z == 0:
        N = N / z
        count += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr.append([i, cnt])

    if temp != 1:
        arr.append([temp, 1])

    if arr == []:
        arr.append([n, 1])

    return arr


if N < 2:
    print(0)
    exit()

prime_fct_arr = factorization(N)
ans = 0
for pair in prime_fct_arr:
    e = pair[1]
    e_cur = 0
    while True:
        if e == e_cur or e == 0:
            break
        e_cur += 1
        e -= e_cur
    ans += e_cur
print(ans)

Submission status: Time Limit Exceeded

Solution code:
def prime_factorization(N):
  n = int(N**0.5)
  primeList = [i if i != 1 else 2 for i in range(1, n, 2) ]
  for data in primeList:
    primeList = [x for x in primeList if (x == data or x%data != 0)]
  return primeList
 
N = int(input())
ans = 0
 
primeList = prime_factorization(N)

for p in primeList:
  e = 1
  while N % p == 0:
    if N % p ** e == 0:
      N //= p ** e
      e += 1
      ans += 1
    else:
      N = N / p
    
print(ans)

Submission status: Time Limit Exceeded

Solution code:
from collections import Counter

n = int(input())

def primes(x):
   is_prime = [True] * (x+1)
   is_prime[0] = False
   is_prime[1] = False
   for i in range(2, int(x**0.5)+1):
      if not is_prime[i]:
         continue
      for j in range(i*2, x+1, i):
         is_prime[j] = False
   return [i for i in range(x+1) if is_prime[i]]

pl = primes(int(n**0.5)+1)

def factorization(x):
   arr = []
   tmp = x
   while x > 1:
      for i in pl:
         if x % i == 0:
            x /= i
            arr.append(i)
            break
      if x == tmp and len(arr) == 0:
         return [x]
   return arr

ans = 0
for k, v in Counter(factorization(n)).items():
   i = 0
   while v > i:
      i += 1
      v -= i
      ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
def func(N):
    tmp=N
    arr=[]
    for i in range(2,N//2+1):
        if tmp%i==0:
            cnt=0
            while tmp%i==0:
                cnt+=1
                tmp//=i
            arr.append([i,cnt])
            
    if tmp!=1 or arr==[]:
        arr.append([tmp, 1])
    return arr

N=int(input())
a=func(N)
ans=0
if a[0][0]==1:
        print(0)
        exit()
        
b=[1,3,6,10,15,21,28,36,45]
for i in a:
    for j in range(len(b)):
       if  i[1]<b[j]:
          ans+=j
          break
print(ans)

Submission status: Time Limit Exceeded

Solution code:
from itertools import accumulate
from collections import defaultdict


def main():
    n = int(input())
    prime_counter = defaultdict(int)  # key ^ value
    acc = tuple(accumulate(range(1, 42)))  # because 10^12 < 2^39

    def facs(n):
        yield 2
        for x in range(3, int(pow(n, 0.5)) + 1, 2):
            yield x
        yield n

    for fac in facs(n):
        while n % fac == 0:
            n //= fac
            prime_counter[fac] += 1
            # ここで if fac * fac > n: braek を入れると，
            # 計算量の少ないケースでは早く，多いケースでは遅くなる。
    if n != 1:
        prime_counter[n] += 1

    ans = 0
    for c in prime_counter.values():
        for i, x in enumerate(acc):
            if c < x:
                tmp = i
                break
        ans += tmp
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
from itertools import accumulate
from collections import defaultdict


def main():
    n = int(input())
    prime_counter = defaultdict(int)  # key ^ value
    acc = tuple(accumulate(range(1, 42)))  # because 10^12 < 2^39

    def facs(n):
        yield 2
        for x in range(3, int(n ** 0.5) + 1, 2):
            yield x
        yield n

    for fac in facs(n):
        while n % fac == 0:
            n //= fac
            prime_counter[fac] += 1
            # ここで if fac * fac > n: braek を入れると，
            # 計算量の少ないケースでは早く，多いケースでは遅くなる。
    if n != 1:
        prime_counter[n] += 1

    ans = 0
    for c in prime_counter.values():
        for i, x in enumerate(acc):
            if c < x:
                tmp = i
                break
        ans += tmp
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
from functools import reduce
from bisect import bisect

def soinsuu_bunkai(n):
    ret = {}
    p = 2
    while p * p <= n:
        while n % p == 0:
            ret[p]= ret[p]+1 if p in ret else 1
            n //= p
        p += 1
    if n != 1:
        ret[n] = 1
    return ret   
    
def make_triangle(n):
    lst = []
    sum_ = 0
    for i in range(1,n+1):
        sum_ += i
        lst.append(sum_)
    return lst    

N = int(input())
dic = soinsuu_bunkai(N)
lst = make_triangle(N)
#print(lst)
#print(dic)
ans = 0
for k,v in dic.items():
    b = bisect(lst,v)
    #print(b)
    ans += b
print(ans)

Submission status: Time Limit Exceeded

Solution code:
from collections import Counter
N = int(input())
factors = []
i = 2
while N > 1:
  if N < i * i:
    factors.append(N)
    break
  while N % i == 0:
    factors.append(i)
  i += 1

ans = 0
for count in Counter(factors).values():
  i = 1
  while count >= i:
    count -= i
    i += 1
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
from collections import Counter
N = int(input())
factors = []
i = 2
while N > 1:
  while N % i == 0:
    factors.append(i)
    N //= i
  i += 1

ans = 0
for count in Counter(factors).values():
  i = 1
  while count >= i:
    count -= i
    i += 1
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
def is_prime(num:int):
    if num == 1:
        return False
    elif num == 2:
        return True
    elif num % 2 == 0:
        return False

    r_num = int(num ** 0.5)
    for i in range(3, r_num + 1, 2):
        if num % i == 0:
            return False
    return True


def main():
    n = int(input())

    if n == 1:
        print(0)
        return

    cnt = 0
    r_n = int(n ** 0.5)
    for i in range(2, n):
        if n < i:
            break
        elif cnt == 0 and r_n+1 < i:
            break
        if n % i == 0 and is_prime(i):
            n = int(n/i)
            cnt += 1
            x = 2
            while True:
                q = i ** x
                if q > n:
                    break

                if n % q == 0:
                    n = int(n/q)
                    x += 1
                    cnt += 1
                else:
                    break

    if cnt == 0:
        cnt = 1
    print(cnt)


main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    ans = 0

    e = 1
    for fac in (2, *(x * 2 + 3 for x in range(pow(10, 12)))):
        while n % (div := pow(fac, e)) == 0:
            n //= div
            ans += 1
            e += 1

        while n % fac == 0:
            n //= fac

        if fac * fac > n:
            break
        e = 1

    if n != 1:
        ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    n = int(input())
    ans = 0

    fac = 2
    e = 1
    while pow(fac, 2) <= n:
        while n % (div := pow(fac, e)) == 0:
            n //= div
            ans += 1
            e += 1

        while n % fac == 0:
            n //= fac

    fac = 3
    e = 1
    while pow(fac, 2) <= n:
        while n % (div := pow(fac, e)) == 0:
            n //= div
            ans += 1
            e += 1

        while n % fac == 0:
            n //= fac
        e = 1
        fac += 2

    if n != 1:
        ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())


def soinnsuubunnkai(num):
    num_list = []
    for i in range(2, num):
        if i % 2 == 0 and i % 3 == 0:
            continue
        else:
            if num%i == 0:
                while num % i == 0:
                    num /= i
                    num_list.append(i)
        if num == 1:
            break

    return num_list


N_list = soinnsuubunnkai(N)
if N == 1:
    print(0)
elif len(N_list) == 0:
    print(1)

else:

    count = 0
    beforenum = 0
    n = 1
    z = []
    for i in range(0, len(N_list)):
        tmp = N_list[i]
        if tmp == beforenum or n == 1:
            n *= tmp
        else:
            n = tmp
        beforenum = tmp
        if n in z:
            continue
        else:
            count += 1
            z.append(n)
            n = 1
    print(count)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())


def soinnsuubunnkai(num):
    num_list = []
    for i in range(2, N):
        if i % 2 == 0 and i % 3 == 0:
            continue
        else:
            if num%i == 0:
                while num % i == 0:
                    num /= i
                    num_list.append(i)
        if num == 1:
            break
    return num_list


if N == 1:
    print(0)

else:
    N_list = soinnsuubunnkai(N)
    count = 0
    beforenum = 0
    n = 1
    z = []
    for i in range(0, len(N_list)):
        tmp = N_list[i]
        if tmp == beforenum or n == 1:
            n *= tmp
        else:
            n = tmp
        beforenum = tmp
        if n in z:
            continue
        else:
            count += 1
            z.append(n)
            n = 1
    print(count)

Submission status: Time Limit Exceeded

Solution code:
def primes(n: int):
    __primes = set(range(2, n + 1))
    for i in range(2, int(n ** 0.5 + 1)):
        __primes.difference_update(range(i * 2, n + 1, i))
    return list(__primes)


def main():
    n = int(input())
    pn = n
    cnt = 0
    while pn > 10 ** 7:
        pn = int(pn/10)

    prime_list = primes(pn)

    pp = []
    for p in prime_list:
        if n % p == 0:
            n /= p
            pp.append(p)
            cnt += 1
        elif n < p:
            break

    for p in pp:
        x = 2
        while True:
            q = p ** x
            if q > n:
                break

            if n % q == 0:
                n /= q
                x += 1
                cnt += 1
            else:
                break

    if pn != n and cnt == 0:
        cnt = 1
    print(cnt)


main()

Submission status: Time Limit Exceeded

Solution code:
import math

n = int(input())
already = []
primes = []

def is_prime(n):
    for p in range(2, n):
        if n % p == 0:
            return False
    return True


test = []
for p in range(2, n//2):
    if is_prime(p):
        primes.append(p)
for prime in primes:
    tmp = 1
    
    while True:
        tmp *= prime
        if tmp > n:
            break
        test.append(tmp)

test.sort()

for item in test:
    if n % item == 0:
        already.append(item)
        n = n // item

print(len(already))

Submission status: Time Limit Exceeded

Solution code:
A=a=int(input())
count=2
samenumcount=0
y=[]
while A!=1:
    if A%count==0:
        samenumcount+=1
        y.append(count**samenumcount)
        A=A/count
    else:
        count+=1
        samenumcount=0
y.sort()

count2=0
for i in y:
    if a==1:
      break
    if a%i==0:
        #print(a,i)
        a=a/i
        count2+=1

print(count2)

Submission status: Time Limit Exceeded

Solution code:
from collections import defaultdict
import decimal
import sys
input = sys.stdin.readline


def prime_list(limit, until_limit=True):
    lst = [2]
    for num in range(3, limit, 2):
        if num ** 2 > limit and not until_limit:
            break

        for p_num in lst:
            if num % p_num == 0:
                break
            elif p_num * p_num > num:
                lst.append(num)
                break
    return lst


def prime_factor_count():
    pass


def main():
    n = int(input())
    p_list = prime_list(n)

    d = defaultdict(int)
    tmp = n
    for i in p_list:
        while 1:
            if tmp % i != 0:
                break
            else:
                tmp //= i
                d[i] += 1
        if tmp == 0:
            break

    cnt = 0
    tmp_n = 0
    for k, v in d.items():
        exp_cnt = 1
        while 1:
            if exp_cnt > v:
                break
            else:
                if tmp_n % (tmp_exp := k ** exp_cnt) == 0:
                    tmp_n //= tmp_exp
                    cnt += 1
                    v -= exp_cnt
                    exp_cnt += 1
    else:
        if n == tmp_n:
            cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

p = 2
counter = 0
while N != 1:
 ind = 0
 n = -1
 while N % p == 0:
  N //= p
  ind += 1
 if ind == 0:
  p += 1
  continue
 while (n+1)*(n+2)//2 <= ind:
  n += 1
 counter += n
 p += 1

print(counter)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

p = 2
counter = 0
while N != 1:
  ind = 0
  n = -1
  while N % p == 0:
    N //= p
    ind += 1
  while (n+1)*(n+2)//2 <= ind:
    n += 1
  counter += n
  p += 1

print(counter)

Submission status: Time Limit Exceeded

Solution code:
import math

def generatePrime(n):
    limit = math.sqrt(n)
    candidate = [i for i in range(3, n, 2)]
    for c in range(len(candidate)):
        if candidate[c] > limit:
            break
        for i in range(len(candidate)-1,c,-1):
            if candidate[i]%candidate[c] == 0:
                candidate.pop(i)
    
    candidate.insert(0, 2) 
    return candidate


def main():
    N = int(input())
    n = N
    count = 0

    prime = generatePrime(N)

    if N in prime:
        print(1)
        exit(0)

    for p in prime:
        if p > n:
            break
        for e in range(1,N):
            z = p**e
            if z>n:
                break
            if n%z == 0:
                count+=1
                n /= z
    print(count)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
import math

n = int(input())
pls = []

for i in range(2, math.floor(math.sqrt(n)) + 1):
    m = 0
    if len(pls) == 0:
        pls.append(i)
    else:
        r = math.sqrt(i) // 1
        k = 0
        while pls[k] <= r:
            if i % pls[k] == 0:
                m = 1
                break
            k += 1
        if m == 0:
            pls.append(i)

if len(pls) == 0:
    print(0)
else:
    fact = []
    for i in range(len(pls)):
        m = n
        k = 0
        if m % pls[i] == 0:
            while m % pls[i] == 0:
                k += 1
                m = m  // pls[i]
            fact.append([pls[i],k])
        else:
            fact.append([pls[i],0])
    fact2 =[]
    for i in range(len(fact)):
        if fact[i][1] != 0:
            fact2.append(fact[i])
    if len(fact2) == 0:
        fact2 = [[n,1]]
    ans = 0
    for i in range(len(fact2)):
        k = fact2[i][1]
        l = 1
        while k >= l:
            k -= l
            ans += 1
            l += 1
    if n == 2:
        print(1)
    else:
        print(ans)

Submission status: Time Limit Exceeded

Solution code:
import math

def prime(x):
    if x==1:
        prime=False
    else:
        prime=True
        for i in range(2,int(math.sqrt(x)+1)):
            if x%i==0:
                prime=False
                break
    return prime

def count_prime(N):    
    if prime(N):
        prime_self=True
        p=[]
    else:
        prime_self=False
        p=[0 for n in range(N//2)]
        end=False
        while N>1 and end==False:
            rtN=int(math.sqrt(N)+1)
            for i in range(2,rtN):
                if N%i==0 and prime(i):
                    p[i]+=1
                    N=N//i
                    break
            if prime(N):
                p[N]+=1
                end=True
    return p,prime_self

def main():
    N=int(input())
    p=count_prime(N)[0]
    cnt=0
    for n in range(len(p)):
        num=1
        while p[n]>=1:
            p[n]-=num
            if p[n]>=0:
                cnt+=1
            num+=1
    if count_prime(N)[1]:
        cnt+=1
    print(cnt)
        
if __name__=="__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
import math
def prime(n):
  for x in range(2, math.isqrt(n)+1):
    if n%x==0:
      return False
  return True

n = int(input())
count = 0
h = math.isqrt(n)
s = set()
for x in range(2,h+1):
  if n==1:
    break
  if x in s or not prime(x):
      continue
  p = 1
  while n>1 and n%(x**p)==0:
    n //= (x**p)
    s.add(x**p)
    count += 1
    p += 1

if count:
  print(count)
else :
  if n==1:
    print(0)
  else :
  	print(1)