divide and conquer - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
9286	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
9279	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	(None)
9363	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
9358	P1983D Swap Dilemma constructive algorithms divide and conquer greedy math sortings	0 / 0	(None)
9321	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10
9320	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
9313	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10
9401	P1990F Polygonal Segments data structures divide and conquer two pointers	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories