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
dgenxsid: 2021-04-30 18:18:27

Solved using a bitwise sieve.

akashjarvis: 2021-04-14 18:04:40

@ramsaicrony i am also getting the same issue can you help me out

n7hoatt: 2021-04-07 13:18:42

well well

rushi2001: 2021-03-29 13:36:09

It might give tle in your compliler but will work here

abhinav11212: 2021-02-24 11:42:11

where can i find solution to this problem

souhardya12774: 2021-02-18 10:05:45

right

codephilic: 2021-02-12 05:30:52

@kalai7m we had to print 1st prime then 101 th primes then 201th primes
Hint:Store all primes in vector/array then print 1 , 101 ..... primes
Hope this will help someone !

Last edit: 2021-02-12 05:31:35
mayank1987: 2021-02-05 07:33:23

i m getting tle even i used sieve help

atul0740: 2021-02-03 13:20:58

use printf instead of cout and \n istead of endl , tle will get removed

rrdesh_07: 2021-01-26 12:48:29

my solution got tle ,even though it executed perfectly on local compiler
my solution id:- 27341107


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