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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1088	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	(None)
	1080	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(None)
	1064	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	(None)
	1002	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	(None)
	979	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	(None)
	946	P1470F Strange Covering divide and conquer *3500	0 / 0	(None)
	882	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	(None)
	845	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	(None)
	837	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(None)
	818	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(None)
	774	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(None)
	663	P1523G Try Booking data structures divide and conquer *3200	0 / 0	(None)
	643	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(None)
	642	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(None)
	542	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(None)
	527	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(None)
	524	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
	520	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
	512	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	487	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)

Pick a problem randomly based on the current filter.