divide and conquer - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3302	P566C Logistical Questions dfs and similar divide and conquer trees *3000	0 / 0	(None)
	3322	P573D Bear and Cavalry data structures divide and conquer dp *3000	0 / 0	(None)
	3332	P576C Points on Plane constructive algorithms divide and conquer geometry greedy sortings *2100	0 / 0	(None)
	3401	P603E Pastoral Oddities data structures divide and conquer dsu math trees *3000	0 / 0	(None)
	3444	P627C Package Delivery data structures divide and conquer greedy *2200	0 / 0	(None)
	3472	P632E Thief in a Shop divide and conquer dp fft math *2400	0 / 0	(None)
	3510	P660F Bear and Bowling 4 binary search data structures divide and conquer geometry ternary search *2500	0 / 0	(None)
	3517	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	(None)
	3523	P665E Beautiful Subarrays data structures divide and conquer strings trees *2100	0 / 0	(None)
	3550	P678F Lena and Queries data structures divide and conquer geometry *2500	0 / 0	(None)
	3570	P685E Travelling Through the Snow Queen's Kingdom bitmasks brute force divide and conquer graphs *2800	0 / 0	(None)
	3715	P744B Hongcow's Game bitmasks divide and conquer interactive *1900	0 / 0	(None)
	3735	P750E New Year and Old Subsequence data structures divide and conquer dp matrices *2600	0 / 0	(None)
	3745	P755G PolandBall and Many Other Balls combinatorics divide and conquer dp fft math number theory *3200	0 / 0	(None)
	3768	P763E Timofey and our friends animals data structures divide and conquer dsu *2900	0 / 0	(None)
	3798	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	(None)
	3812	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	(None)
	3833	P786C Till I Collapse data structures divide and conquer *2400	0 / 0	(None)
	3838	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	(None)
	3847	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.