tag:blogger.com,1999:blog-811371107174953309.post979782887499528536..comments2023-06-03T21:57:31.715+06:00Comments on forthright48: Number of Divisors of an Integer Mohammad Samiul Islamhttp://www.blogger.com/profile/02529335254206670632noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-811371107174953309.post-79790144791966440272018-08-29T12:56:31.250+06:002018-08-29T12:56:31.250+06:00Well, in worst case (when we are trying to factori...Well, in worst case (when we are trying to factorize some large prime), it is O(P(sqrt(N))), where P(n) is number of prime less than n.<br /><br />In practice, this is good enough. Usually problems give you composite numbers for factorization. But I did once get TLE by using this code. For that problem, the judge data contained lots of Prime numbers and that resulted this code to perform its Mohammad Samiul Islamhttps://www.blogger.com/profile/02529335254206670632noreply@blogger.comtag:blogger.com,1999:blog-811371107174953309.post-45686185921785830442018-08-01T04:41:46.184+06:002018-08-01T04:41:46.184+06:00What is the Time Complexity of "Code Using Pr...What is the Time Complexity of "Code Using Prime Factorization" ?Indro's Programminghttps://www.blogger.com/profile/12260407924399419588noreply@blogger.comtag:blogger.com,1999:blog-811371107174953309.post-20799844824382528032016-10-28T14:30:10.968+06:002016-10-28T14:30:10.968+06:00Such a great Article.
Thanks for it.Such a great Article. <br />Thanks for it.Anonymoushttps://www.blogger.com/profile/15635907664390970928noreply@blogger.com