divide and conquer - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1246	P1663B Mike's Sequence *special problem divide and conquer implementation math	0 / 0	(None)
	1235	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	9
	1196	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1179	P1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	9
	1156	P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	5
	1135	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
	1129	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1114	P1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	10
	1058	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	6
	1044	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1023	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	934	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	888	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	882	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	855	P1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	6
	806	P1730E Maximums and Minimums combinatorics data structures divide and conquer number theory *2700	0 / 0	10
	780	P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	9
	729	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	725	P1741D Masha and a Beautiful Tree dfs and similar divide and conquer graphs sortings trees *1300	0 / 0	4
	650	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	627	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	482	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	451	P1770G Koxia and Bracket divide and conquer fft math *3400	0 / 0	10
	433	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	367	P1777F Comfortably Numb bitmasks data structures divide and conquer strings trees *2400	0 / 0	9
	314	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	292	P1787I Treasure Hunt data structures divide and conquer two pointers *3400	0 / 0	10
	271	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy math shortest paths trees *2100	0 / 0	7
	247	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	239	P1793F Rebrending brute force data structures divide and conquer implementation *2600	0 / 0	10
	233	P1794D Counting Factorizations combinatorics divide and conquer dp math number theory *1900	0 / 0	6
	203	P1797F Li Hua and Path data structures dfs and similar divide and conquer dsu trees *3000	0 / 0	10
	159	P1801E Gasoline prices data structures divide and conquer dsu hashing trees *3000	0 / 0	10
	144	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths *2700	0 / 0	10
	104	P1808E1 Minibuses on Venus (easy version) combinatorics divide and conquer dp *2200	0 / 0	8
	102	P1808E2 Minibuses on Venus (medium version) combinatorics divide and conquer dp matrices *2500	0 / 0	9
	50	P1814F Communication Towers brute force divide and conquer dsu *2700	0 / 0	10
	9798	P1817E Half-sum brute force divide and conquer greedy *3400	0 / 0	10
	1	P1822G2 Magic Triples (Hard Version) binary search brute force divide and conquer math number theory	0 / 0	(None)
	9923	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	9916	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	9881	P1848F Vika and Wiki binary search bitmasks combinatorics divide and conquer dp math *2400	0 / 0	9
	9958	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers	0 / 0	(None)
	9957	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees	0 / 0	(None)
	9991	P1856D More Wrong divide and conquer interactive *2100	0 / 0	7
	9982	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	9970	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
	10111	P1874D Jellyfish and Miku divide and conquer dp math probabilities	0 / 0	(None)
	10085	P1879D Sum of XOR Functions bitmasks combinatorics divide and conquer dp math *1700	0 / 0	5
	10072	P1886E I Wanna be the Team Leader bitmasks divide and conquer dp two pointers	0 / 0	(None)
	10148	P1887D Split binary search data structures divide and conquer dsu math trees two pointers	0 / 0	(None)
	10215	P1896D Ones and Twos binary search data structures divide and conquer math two pointers *1700	0 / 0	5
	10211	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory *3400	0 / 0	10
	10204	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	10295	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	10236	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	10288	P1915F Greetings data structures divide and conquer sortings *1500	0 / 0	5
	10280	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	10221	P1917D Yet Another Inversions Problem combinatorics data structures divide and conquer math *2300	0 / 0	8
	10343	P1918E ace5 and Task Order constructive algorithms divide and conquer implementation interactive probabilities sortings *2200	0 / 0	8
	10270	P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 2	10
	10255	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	10429	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings *2100	0 / 0	7
	10386	P1936E Yet Yet Another Permutation Problem divide and conquer fft math *3400	0 / 0	10
	10510	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings	0 / 0	(None)
	10478	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math	0 / 0	(None)
	10602	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	10551	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	10544	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	(None)
	10674	P1982E Number of k-good subarrays bitmasks brute force combinatorics divide and conquer dp math meet-in-the-middle *2300	0 / 0	8
	10639	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10
	10638	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
	10751	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
	10631	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10
	10744	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees *2600	0 / 0	10
	10743	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	10
	10700	P1997E Level Up binary search brute force data structures divide and conquer implementation	0 / 0	(None)

Pick a problem randomly based on the current filter.