Skip to main content

Timeline for Prime number generation - SPOJ

Current License: CC BY-SA 4.0

17 events
when toggle format what by license comment
Oct 1, 2018 at 10:20 vote accept Sridhar Cr
Oct 1, 2018 at 10:20 vote accept Sridhar Cr
Oct 1, 2018 at 10:20
Oct 1, 2018 at 10:20 vote accept Sridhar Cr
Oct 1, 2018 at 10:20
Oct 1, 2018 at 10:19 comment added Sridhar Cr Actually it is possible to solve with Java. Here: jamie-wong.com/2009/11/12/spoj-problem-2-prime-generator
Oct 1, 2018 at 10:12 comment added user158037 There is at least 1 Prime generation task on SPOJ that requires to use cache aware C/C++ code and time limits are so tight it is impossible to do it in Java/most other languages.
Oct 1, 2018 at 8:57 comment added Peter Taylor Related, related. Some of the comments on those earlier attempts at the same problem may not be applicable to this code, but I mention them also for future searchers whose code they may apply to.
Oct 1, 2018 at 5:49 history edited AJNeufeld CC BY-SA 4.0
Politeness
Oct 1, 2018 at 5:45 comment added AJNeufeld Bug: 1 is not a prime number. You should start your initialization loop at 2 to ensure arr[0] and arr[1] are false.
Oct 1, 2018 at 5:42 answer added vnp timeline score: 1
Oct 1, 2018 at 5:41 answer added AJNeufeld timeline score: 1
Oct 1, 2018 at 5:23 comment added Sridhar Cr Constraints added
Oct 1, 2018 at 5:21 history edited AJNeufeld
added tags
Oct 1, 2018 at 5:14 history edited Sridhar Cr CC BY-SA 4.0
added 199 characters in body
Oct 1, 2018 at 4:32 history edited Jamal CC BY-SA 4.0
deleted 9 characters in body
Oct 1, 2018 at 4:15 comment added vnp Please add the restrictions. How many test cases? What are the m, n ranges?
Oct 1, 2018 at 2:20 review First posts
Oct 1, 2018 at 8:03
Oct 1, 2018 at 2:19 history asked Sridhar Cr CC BY-SA 4.0