TUDORTEA's blog

How to generate prime numbers up to 10^9 in 2.2 seconds?
By TUDORTEA, history, 4 years ago, In English

Link of the problem is https://www.spoj.com/problems/PRIMES2 .

Which algorithm should be used to solve this problem? And how wheelSieve + segmentedSieve is implemented?

Thank you in advance.

  • Vote: I like it
  • -19
  • Vote: I do not like it

Comments Comments (3)
| Write comment?
»
4 years ago, # |
  Vote: I like it +11 Vote: I do not like it

see this and please try googling stuff(to know if it's solution already exists somewhere) before posting new blog.

→ Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    first of all, thank you. I tried codes from your link, but I got TLE. What should I do to avoid to TLE???

    → Reply