How to solve problem D in codeforces DIV3 round 611 using Binary search ? - Codeforces

→ Pay attention

Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
23:27:56
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 →

How to solve problem D in codeforces DIV3 round 611 using Binary search ?

Revision en1, by bully....maguire, 2019-12-29 11:57:20

In the problem tag it is mentioned that it can be solved using binary search.How to solve it using binary search ?

Tags

#help, #611 div3

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en2		bully....maguire	2019-12-29 13:13:17	47	Tiny change: 'y search ?' -> 'y search ?\nhttps://codeforces.net/contest/1283/problem/D'
	en1		bully....maguire	2019-12-29 11:57:20	187	Initial revision (published)