< Back to forum

kPrime TLE



im getting tle for this question....any suggestion to overcome ..???????


Asked by: Nitesh_Kumar on April 7, 2019, 6:34 p.m. Last updated on April 7, 2019, 6:34 p.m.

Enter your answer details below:


Enter your comment details below:


1 Answer(s)


You are computing the prime factors of the number ,say N, in range [a,b] in O(N^1/2) compexity which is resulting in TLE. You have to derive some pre-processed table using which which you can compute this in constant time. This can be achieved using Sieve of Eratosthenes for which you can refer here .

Abhishek_Chaudhary last updated on April 7, 2019, 6:34 p.m. 0    Reply    Upvote   

Instruction to write good question
  1. 1. Write a title that summarizes the specific problem
  2. 2. Pretend you're talking to a busy colleague
  3. 3. Spelling, grammar and punctuation are important!

Bad: C# Math Confusion
Good: Why does using float instead of int give me different results when all of my inputs are integers?
Bad: [php] session doubt
Good: How can I redirect users to different pages based on session data in PHP?
Bad: android if else problems
Good: Why does str == "value" evaluate to false when str is set to "value"?

Refer to Stack Overflow guide on asking a good question.