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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4376	P757G Can Bash Save the Day? data structures divide and conquer graphs trees *3400	0 / 0	(None)
	4351	P763E Timofey and our friends animals data structures divide and conquer dsu *2900	0 / 0	(None)
	4330	P768B Code For 1 constructive algorithms dfs and similar divide and conquer *1600	0 / 0	(None)
	4306	P772E Verifying Kingdom binary search divide and conquer interactive trees *3200	0 / 0	(None)
	4300	P773F Test Data Generation combinatorics divide and conquer dp fft math number theory *3400	0 / 0	(None)
	4281	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	(None)
	4244	P786C Till I Collapse data structures divide and conquer *2400	0 / 0	(None)
	4236	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	(None)
	4220	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	(None)
	4219	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	(None)
	4144	P809C Find a car combinatorics divide and conquer dp *2600	0 / 0	(None)
	4142	P809E Surprise me! divide and conquer math number theory trees *3100	0 / 0	(None)
	4108	P817D Imbalanced Array data structures divide and conquer dsu sortings *1900	0 / 0	(None)
	4051	P833B The Bakery binary search data structures divide and conquer dp two pointers *2200	0 / 0	(None)
	4049	P833D Red-Black Cobweb data structures divide and conquer implementation trees *2800	0 / 0	(None)
	4010	P842E Nikita and game binary search dfs and similar divide and conquer graphs trees *2800	0 / 0	(None)
	3974	P848C Goodbye Souvenir data structures divide and conquer *2600	0 / 0	(None)
	3972	P848E Days of Floral Colours combinatorics divide and conquer dp fft math *3400	0 / 0	(None)
	3965	P850E Random Elections bitmasks brute force divide and conquer fft math *2800	0 / 0	(None)
	3915	P862D Mahmoud and Ehab and the binary string binary search divide and conquer interactive *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.