TDPRIMES - Printing some primes


The problem statement is really simple. You are to write all primes less than 10^8

Input

There is not 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
Fahmi: 2011-06-27 05:48:43

Last edit: 2012-12-24 00:53:13
hendrik: 2011-04-29 13:41:58

Why these language limitations? Could it be opended for HASK or even better for all?

sandeep pandey: 2011-03-03 17:17:46

Last edit: 2011-03-07 19:56:17
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..
after ,it,s a very easy task!!!

Last edit: 2011-03-03 18:52:54
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).......

: 2010-11-28 12:59:22

Why don't you open it for all languages?

!!!!!: 2010-10-03 11:54:13

lolzzz!!! in ma system it's giving ans in 2.4s and tle here..

Vimal poonia: 2010-07-16 16:26:56

my accepted program on 7.6 going tle nw
i think spoj machines are not belivable !!


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 qobi SCM guile ST SQLITE TCL WHITESPACE
Resource:Thanks to TDuke