TDPRIMES - Printing some primes


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

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
Mostafa 36a2: 2013-12-26 16:27:03

This was in my TODO since 2012-07-05 ..
finally AC :D

P_Quantum: 2013-09-17 07:39:34

Finally AC..!!

shinchan: 2013-08-26 15:49:42

3.8 sec in my compiler but tle:(

Last edit: 2013-09-07 01:41:49
Akhilesh Anandh: 2013-08-25 16:20:11

Passed in 9.32.. whew :)

The Mundane Programmer: 2013-08-24 20:08:28

Runtime Error :(

_maverick: 2013-08-11 20:07:49

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: 2013-08-09 02:12:23

time limit exceeded

Parshant garg: 2013-07-27 08:25:35

SIGKILL error... but my code is working on my system.. how to fix this

shiva_hellgeek: 2013-06-22 20:19:13

Learned a lot from this one really a nice problem... :)

Himanshu: 2013-06-13 09:53:56

@atul u are wrong we can store them.......


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 clisp LISP sbcl 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