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
aditya04848spo: 2021-01-19 06:54:13

Use bool array in c/c++, other languages forget about it, use c++ instead, like what i did.

ratnesh123: 2021-01-08 08:20:37

i am getting TLE in python,can anyone help

akash2297: 2021-01-02 07:46:01

AC on first submit using only normal sieve!!!

ramsaicrony: 2020-12-16 12:04:27

can anyone help me....my code is giving output for 10^7 but it is giving segmentation fault for 10^8
i used bitwise sieve...

iqbal_mahmud: 2020-12-09 05:46:18

1st mod 100 after mean the loop start 0 and then increment 0+100

smap: 2020-10-07 09:52:11

You have to print n_th prime number if (n%100 == 1) .
You have to print the prime number itself. Don't print the prime number modulo 100.

karthik_spoj1: 2020-10-05 07:29:34

spoj is provides more space than other editors
so normal seive goes well here

satwikmishra1: 2020-08-07 08:14:50

weird,normal seive,might not run on tool but gets accepted out here.
normal seive works well.
happy coding.

zero_iteration: 2020-07-13 19:28:33

Accepted in one go :D.
using only normal sieve.

w_u_r: 2020-07-08 10:16:03

Accepted In one go:) Normal Sieve

Last edit: 2020-07-08 10:16:19

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