Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
n=input() e=m=0 f=2 while~-n: if n%f:f+=1;e=0 else:e+=1;m=maxq=n%f<1;f+=1-q;e=q*-~e;m=max(m,e);n/=f=f**q print m -25 thanks to ovs.
This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.
n=input() e=m=0 f=2 while~-n: if n%f:f+=1;e=0 else:e+=1;m=max(m,e);n/=f print m -2 thanks to ovs.
This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.
n=input() e=m=0 f=2 while~-n:q=n%f<1;f+=1-q;e=q*-~e;m=max(m,e);n/=f**q print m -5 thanks to ovs.
This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.
n=input() e=m=0 f=2 while~-n: if n%f<1n%f:f+=1;e=0 else:e+=1;m=max(m,e);n/=f else:f+=1;e=0 print m -2 thanks to ovs.
This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.
n=input() e=m=0 f=2 while~-n: if n%f<1:e+=1;m=max(m,e);n/=f else:f+=1;e=0 print m This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.
n=input() e=m=0 f=2 while~-n: if n%f:f+=1;e=0 else:e+=1;m=max(m,e);n/=f print m -2 thanks to ovs.
This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.
n=input() e=m=0 f=2 while~-n: if n%f<1:e+=1;m=max(m,e);n/=f else:f+=1;e=0 print m This answer doesn't do prime checks. Instead, it takes advantage of the fact that the highest exponent of a prime factor will be greater than or equal to the exponent of any other factor in any factorization of a number.