Is this Code Ok to get saved from TLE and What will be the time Complexity of this??? - Codeforces

→ Pay attention

Before contest
Rayan Programming Contest 2024 - Selection (Codeforces Round, Div. 1 + Div. 2)
5 days
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	3993
2	jiangly	3743
3	orzdevinwang	3707
4	Radewoosh	3627
5	jqdai0815	3620
6	Benq	3564
7	Kevin114514	3443
8	ksun48	3434
9	Rewinding	3397
10	Um_nik	3396

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	167
2	Um_nik	163
3	maomao90	162
3	atcoder_official	162
5	adamant	159
6	-is-this-fft-	158
7	awoo	156
8	TheScrasse	154
9	Dominater069	153
10	nor	152

View all →

→ Find user

→ Recent actions

Detailed →

Is this Code Ok to get saved from TLE and What will be the time Complexity of this???

Revision en1, by bideshbanerjee444, 2022-02-10 09:18:46

for(int i = 2; i <= int(1e6); i++){ for(int j = 0; j <= int(1e6); j += i){ //Here anything which takes O(1) time.....
} }

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		bideshbanerjee444	2022-02-10 09:20:18	149
	en1		bideshbanerjee444	2022-02-10 09:18:46	227	Initial revision (published)