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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5844	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(None)
	5926	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(None)
	5998	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(None)
	6001	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(None)
	6006	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	6020	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(None)
	6102	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
	6153	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
	6159	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(None)
	6205	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(None)
	6215	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
	6232	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
	6282	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)

Pick a problem randomly based on the current filter.