We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
defis_prime(n):ifn<2:returnFalseelse:foriinrange(2,round(math.sqrt(n))+1):ifn%i==0:returnFalsereturnTruedefprimeCount(n):# Write your code herecount=0mult=1foriinrange(2,math.ceil(math.sqrt(n))+1):ifis_prime(i):mult*=iifmult<=n:count+=1else:breakreturncount
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Leonardo's Prime Factors
You are viewing a single comment's thread. Return to all comments →