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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7562	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	(None)
	7511	P19E Fairy dfs and similar divide and conquer dsu *2900	0 / 0	(None)
	7243	P68D Half-decay tree data structures divide and conquer dp math probabilities *2500	0 / 0	(None)
	7115	P97B Superset constructive algorithms divide and conquer *2300	0 / 0	(None)
	7090	P101E Candies and Stones divide and conquer dp *2500	0 / 0	(None)
	7033	P117D Not Quick Transformation divide and conquer math *2500	0 / 0	(None)
	7032	P117E Tree or not Tree data structures divide and conquer implementation trees *2900	0 / 0	(None)
	7012	P120J Minimum Sum divide and conquer geometry sortings *1900	0 / 0	(None)
	6887	P150E Freezing with Style binary search data structures divide and conquer trees *3000	0 / 0	(None)
	6843	P161C Abracadabra divide and conquer *2400	0 / 0	(None)
	6807	P167D Wizards and Roads data structures divide and conquer graph matchings graphs greedy *3000	0 / 0	(None)
	6671	P196C Paint Tree constructive algorithms divide and conquer geometry sortings trees *2200	0 / 0	(None)
	6584	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	(None)
	6524	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	(None)
	6522	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	(None)
	6513	P234G Practice constructive algorithms divide and conquer implementation *1600	0 / 0	(None)
	6272	P293E Close Vertices data structures divide and conquer trees *2700	0 / 0	(None)
	6164	P321C Ciel the Commander constructive algorithms dfs and similar divide and conquer greedy trees *2100	0 / 0	(None)
	6162	P321E Ciel and Gondolas data structures divide and conquer dp *2600	0 / 0	(None)
	6099	P337D Book of Evil dfs and similar divide and conquer dp trees *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.