"Given a number N, find the numbers below N that are divisible by 3 or 5?" Is there any faster way to solve it without using bruteforce? - Codeforces

→ Pay attention

Before contest
Codeforces Round (Div. 3)
44:04:41
Register now »

→ Streams

CodeChef Starters 132 Solution Discussion

By aryanc403

Before stream 22:14:39

Codeforces Round 943 Solution Discussion

By aryanc403

Before stream 46:29:39

View all →

→ Top rated

#	User	Rating
1	ecnerwala	3649
2	Benq	3581
3	jiangly	3578
4	orzdevinwang	3570
5	Geothermal	3569
5	cnnfls_csy	3569
7	tourist	3565
8	maroonrk	3531
9	Radewoosh	3521
10	Um_nik	3482

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	maomao90	174
2	awoo	165
3	adamant	161
4	TheScrasse	159
5	nor	158
6	maroonrk	156
7	-is-this-fft-	152
8	orz	146
8	SecondThread	146
10	pajenegod	145

View all →

→ Find user

→ Recent actions

Detailed →

"Given a number N, find the numbers below N that are divisible by 3 or 5?" Is there any faster way to solve it without using bruteforce?

Revision en2, by Farnan.PUST, 2016-11-25 23:26:15

I can do it in O(N) time. but can it be more faster?

Tags

number theory, factorization, divisors

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		Farnan.PUST	2016-11-25 23:26:15	13
	en1		Farnan.PUST	2016-11-25 23:24:47	178	Initial revision (published)