TDPRIMES - Printing some primes
The problem statement is really simple. You are to write all primes less than 108.
Input
There is no input.
Output
To make the problem less output related write out only the 1st, 101st, 201st, ... 1st mod 100.
Example
Input: Output: 2 547 1229 ... 99995257 99996931 99998953
hide comments
|
piyush agarwal:
2013-01-16 16:18:32
i m using an array a[100000002] and i m getting Run time error...pls any tell me if we have to use such big array or not?? |
|
saket diwakar:
2013-01-13 17:42:40
yeah.....AC:) |
|
Snehasish Roy ;):
2012-08-16 14:41:02
Nice and tricky problem.
|
|
StupidGuy:
2012-08-09 10:43:13
haha..9.57
|
|
hendrik:
2011-04-29 13:41:58
Why these language limitations? Could it be opended for HASK or even better for all? |
|
Walrus:
2011-02-28 01:36:14
My prime generator generates all primes in 0.345 sec, but TLE here. :( |
|
sandeep pandey:
2011-01-14 22:14:11
try prime generator before solving this problem..
|
|
Alfonso2 Peterssen:
2010-12-21 20:41:29
Remember all the users that SPOJ engine is a Pentium III. :( |
|
.:: Jarv1s ::.:
2010-12-17 20:52:18
My program executes in 7 secs, but I get TLE on SPOJ (time limit here is 10s)....... |
| Added by: | Alfonso² Peterssen |
| Date: | 2010-04-06 |
| Time limit: | 1.325s |
| Source limit: | 10000B |
| Memory limit: | 1536MB |
| 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 guile SCM qobi ST SQLITE TCL WHITESPACE |
| Resource: | Thanks to TDuke |
RSS