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
Gaurav Kumar Verma:
201st, ... 1st mod 100.
.:: Jarv1s ::.:
Cracked It After many attempts. Java giving TLE for same code, accepted in C++ 8.36 seconds. P III computers used by SPOJ are really great at determining run time differences, Hurraaayyyy. Really needs extreme optimization to crack this one (0-0)
Finally Ac after months
This was in my TODO since 2012-07-05 ..
3.8 sec in my compiler but tle:(Last edit: 2013-09-07 01:41:49
Passed in 9.32.. whew :)
The Mundane Programmer:
Runtime Error :(
interesting one as for as my spoj submissions considered.i got runtime error while i compile at ideone while for testing i just submitted here and itz an AC very strange @_@
John and the cows:
time limit exceeded
|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|