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

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

hide comments
2014-09-01 21:09:37 arun vinud
optimized sieve+putchar_unlocked()->AC :)
2014-06-28 09:41:06 [Lakshman]
@surayans tiwari IDEONE is using **CUBE** cluster and here SPOJ is using Pyramid cluster...CUBE id 20X faster than Pyramid.
http://www.spoj.com/clusters
2014-06-28 08:19:59 surayans tiwari(http://bit.ly/1EPzcpv)
running in 1.7 seconds on ideone and tle here please check my code
2014-06-19 20:08:53 Prakhar Gupta
what is SIGKILL??
2014-06-09 13:03:14 Gaurav Kumar Verma
c++ AC, java TLE. :(
can anyone help?
2014-06-06 21:36:02 Gaurav Kumar Verma
201st, ... 1st mod 100.

what does mod 100 means?
--ans(Francky)--> Modulo operations. When the remainder, when dividing by 100, is equal to 1. As of 101, 201, 301, ... 5401, ... but not 511, ...

Last edit: 2014-06-06 21:48:52
2014-02-15 22:25:06 .:: 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)
2014-01-02 15:16:14 Nitish bhagat
Finally Ac after months
2013-12-26 16:27:03 Mostafa 36a2
This was in my TODO since 2012-07-05 ..
finally AC :D
2013-09-17 07:39:34 P_Quantum
Finally AC..!!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.