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

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8867	P1896D Ones and Twos binary search data structures divide and conquer math two pointers *1700	0 / 0	5
	8863	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory *3400	0 / 0	10
	8856	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	8826	P1903D2 Maximum And Queries (hard version) binary search bitmasks divide and conquer dp greedy *2500	0 / 0	9
	8915	P1904D2 Set To Max (Hard Version) constructive algorithms data structures divide and conquer greedy implementation sortings	0 / 0	(None)
	8907	P1905F Field Should Not Be Empty brute force data structures divide and conquer	0 / 0	(None)
	8813	P1906K Deck-Building Game divide and conquer math	0 / 0	(None)
	8888	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	8962	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	8945	P1915F Greetings data structures divide and conquer sortings *1500	0 / 0	5
	8937	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	8925	P1919D 01 Tree constructive algorithms data structures divide and conquer dp greedy implementation sortings trees *2100	0 / 0	7
	8991	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	8986	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6
	9031	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	0 / 0	(None)
	9141	P1936E Yet Yet Another Permutation Problem divide and conquer fft math *3400	0 / 0	10
	9253	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	9221	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	9212	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	9182	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9

Pick a problem randomly based on the current filter.