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
akshayvenkat: 2016-07-05 17:36:19

what? same exact code gave TLE yesterday and AC today :O

Shidhu : 2016-03-25 20:54:26

i have took 0.79 !
it was my first problem solved with sieve :)

Prateek Agarwal: 2016-03-15 20:38:20

How did they do it within 0.1s? mine took 0.44s!

Last edit: 2016-03-15 20:42:19
kicchu_pari_na: 2015-11-02 15:52:05

Um getting RE .. but why ?? I have used Bit wise sieve .

sam_29: 2015-10-25 09:01:51

If you want to apply simple sieve with no optimization then use the Output Given Wisely !!!!!!!!!!!!!!!!

Oasis: 2015-07-08 08:33:04

took 0.64s how to optimize further as there are many ac solutions below 0.5 s

Last edit: 2015-07-08 09:00:20
Avik Sarkar: 2015-07-03 07:29:15

Accepted at 0.46 second

Aditya Kumar: 2015-07-02 05:22:17

Runtime on Ideone.... but, AC in spoj

[Mayank Pratap]: 2015-06-20 10:32:44

Optimised sieve AC in one go.... :

krish: 2015-04-18 15:49:21

optimised seive:)


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