Codeforces Round #688 (Div. 2) Editorial - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
24:11:32
Register now »

*has extra registration

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

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	157
8	TheScrasse	154
9	Dominater069	153
9	nor	153

View all →

→ Find user

→ Recent actions

Detailed →

Codeforces Round #688 (Div. 2) Editorial

Revision en6, by djm03178, 2020-12-04 21:51:22

Tutorial is loading...

Solutions

Tutorial is loading...

Solutions - C++ - Java - Python 3

Tutorial is loading...

Solutions - C++ - Java - Python 3

Tutorial is loading...

Solutions - C++ - Java

Tutorial is loading...

Solutions - C++ - Java

Tutorial is loading...

Solutions - C++ - Java - Python 3

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en6		djm03178	2020-12-04 21:51:22	3	Tiny change: '03)\n- [O(nmlogn) (C++' -> '03)\n- [O((n+m)logn) (C++'
	en5		djm03178	2020-12-04 20:01:21	116
	en4		djm03178	2020-12-04 20:00:15	0	(published)
	en3		djm03178	2020-12-04 19:59:39	1379	Tiny change: '453A]\n* [$\mathcal{O}(nm)$ (C++)](ht' -> '453A]\n* [O(nm) (C++)](ht' (saved to drafts)
	en2		djm03178	2020-12-04 18:42:48	2559	(published)
	en1		djm03178	2020-12-04 18:40:04	2675	Initial revision (saved to drafts)