How to generate prime numbers up to 10^9 in 2.2 seconds? - Codeforces

→ Pay attention

Before contest
Hello 2025
5 days

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3885
3	jqdai0815	3682
4	Benq	3580
5	orzdevinwang	3526
6	ksun48	3506
7	ecnerwala	3505
8	Radewoosh	3457
9	Kevin114514	3377
10	gamegame	3374

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	170
2	Um_nik	162
3	atcoder_official	161
4	maomao90	158
4	-is-this-fft-	158
6	djm03178	157
7	Dominater069	156
8	adamant	154
9	luogu_official	153
10	awoo	152

View all →

→ Find user

→ Recent actions

Detailed →

How to generate prime numbers up to 10^9 in 2.2 seconds?

Revision en1, by TUDORTEA, 2020-09-22 09:58:15

Link of the problem is https://www.spoj.com/problems/PRIMES2 .

Which algorithm should be used to solve this problem? And how wheelSieve + segmentedSieve is implemented?

Thank you in advance.

Tags

#number theory, #primes, #sieve, prime number

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		TUDORTEA	2020-09-22 21:20:31	4	Tiny change: '? And how wheelSieve + segment' -> '? And how wheelSieve + segment'
	en1		TUDORTEA	2020-09-22 09:58:15	252	Initial revision (published)