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

→ Pay attention

Before contest
Educational Codeforces Round 173 (Rated for Div. 2)
39:27:43
Register now »

→ Streams

CF Edu Round 173 Solution Discussion

By aryanc403

Before stream 41:37:42

View all →

→ Top rated

#	User	Rating
1	tourist	3985
2	jiangly	3814
3	jqdai0815	3682
4	Benq	3529
5	orzdevinwang	3526
6	ksun48	3517
7	Radewoosh	3410
8	hos.lyric	3399
9	ecnerwala	3392
9	Um_nik	3392

Countries | Cities | Organizations

→ Top contributors

#	User	Contrib.
1	cry	169
2	maomao90	162
2	Um_nik	162
4	atcoder_official	161
5	djm03178	158
6	-is-this-fft-	157
7	adamant	155
8	awoo	154
8	Dominater069	154
10	luogu_official	150

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 en2, by bideshbanerjee444, 2022-02-10 09:20:18

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)