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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1875	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	(None)
	2072	P68D Half-decay tree data structures divide and conquer dp math probabilities *2500	0 / 0	(None)
	2200	P117E Tree or not Tree data structures divide and conquer implementation trees *2900	0 / 0	(None)
	2290	P150E Freezing with Style binary search data structures divide and conquer trees *3000	0 / 0	(None)
	2318	P161C Abracadabra divide and conquer *2400	0 / 0	(None)
	2421	P196C Paint Tree constructive algorithms divide and conquer geometry sortings trees *2200	0 / 0	(None)
	2473	P217C Formurosa divide and conquer dp expression parsing *2600	0 / 0	(None)
	2510	P232C Doe Graphs constructive algorithms divide and conquer dp graphs shortest paths *2600	0 / 0	(None)
	2511	P232E Quick Tortoise bitmasks divide and conquer dp *3000	0 / 0	(None)
	2658	P293E Close Vertices data structures divide and conquer trees *2700	0 / 0	(None)
	2720	P321C Ciel the Commander constructive algorithms dfs and similar divide and conquer greedy trees *2100	0 / 0	(None)
	2722	P321E Ciel and Gondolas data structures divide and conquer dp *2600	0 / 0	(None)
	2778	P343E Pumping Stations brute force dfs and similar divide and conquer flows graphs greedy trees *2900	0 / 0	(None)
	2831	P364E Empty Rectangles divide and conquer two pointers *3000	0 / 0	(None)
	2954	P413E Maze 2D data structures divide and conquer *2200	0 / 0	(None)
	2980	P429D Tricky Function data structures divide and conquer geometry *2200	0 / 0	(None)
	3056	P459D Pashmak and Parmida's problem data structures divide and conquer sortings *1800	0 / 0	(None)
	3157	P500F New Year Shopping divide and conquer dp *2700	0 / 0	(None)
	3181	P513B2 Permutations bitmasks divide and conquer math *1800	0 / 0	(None)
	3222	P526F Pudding Monsters data structures divide and conquer *3000	0 / 0	(None)

Pick a problem randomly based on the current filter.