TDPRIMES - Printing some primes
The problem statement is really simple. You are to write all primes less than 10^8
There is not input
To make the problem less output related write out only the 1st, 101st, 201st, ... 1st mod 100.
Input: Output: 2 547 1229 ... 99995257 99996931 99998953
Last edit: 2012-12-24 00:53:13
Why these language limitations? Could it be opended for HASK or even better for all?
Last edit: 2011-03-07 19:56:17
My prime generator generates all primes in 0.345 sec, but TLE here. :(
try prime generator before solving this problem..
Remember all the users that SPOJ engine is a Pentium III. :(
.:: Jarv1s ::.:
My program executes in 7 secs, but I get TLE on SPOJ (time limit here is 10s).......
Why don't you open it for all languages?
lolzzz!!! in ma system it's giving ans in 2.4s and tle here..
my accepted program on 7.6 going tle nw
|Added by:||Alfonso² Peterssen|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM32 ASM64 BF CLPS LISP sbcl LISP clisp ERL HASK ICON ICK JS-RHINO LUA NEM NICE OBJC OCAML PHP PIKE PRLG-swi SCALA SCM qobi SCM guile ST SQLITE TCL WHITESPACE|
|Resource:||Thanks to TDuke|