divide and conquer - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4815	P1100F Ivan and Burgers data structures divide and conquer greedy math *2500	0 / 1	9
	4753	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	5
	4743	P1114F Please, another Queries on Array? bitmasks data structures divide and conquer math number theory *2400	0 / 0	9
	4643	P1139F Dish Shopping data structures divide and conquer *2500	0 / 0	9
	4638	P1140E Palindrome-less Arrays combinatorics divide and conquer dp *2200	0 / 0	8
	4637	P1140F Extending Set of Points data structures divide and conquer dsu *2600	0 / 0	10
	4636	P1140G Double Tree data structures divide and conquer shortest paths trees *2700	0 / 0	10
	4601	P1146E Hot is Cold bitmasks data structures divide and conquer implementation *2400	0 / 0	9
	4547	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	6
	4541	P1156D 0-1-Tree dfs and similar divide and conquer dp dsu trees *2200	0 / 0	8
	4540	P1156E Special Segments of Permutation data structures divide and conquer dsu two pointers *2200	0 / 0	8
	4496	P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	4
	4460	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	9
	4455	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	4 / 11	8
	4454	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	1 / 3	9
	4453	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	10
	4445	P1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	6
	4431	P1179E Alesya and Discrete Math divide and conquer interactive *3200	0 / 0	10
	4424	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	9
	4382	P1186E Vus the Cossack and a Field divide and conquer implementation math *2500	0 / 0	9
	4361	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	7
	4355	P1192B Dynamic Diameter *special problem data structures dfs and similar divide and conquer trees	0 / 0	(None)
	4226	P1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	6
	4199	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	10
	4195	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	9
	4194	P1218E Product Tuples divide and conquer fft *2500	0 / 0	9
	4168	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	10
	4123	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	6
	4057	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	9
	3966	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	10
	3951	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	10
	3871	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	10
	3798	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	8
	3732	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	6
	3658	P1295E Permutation Separation data structures divide and conquer *2200	0 / 0	8
	3591	P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	10
	3545	P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	6
	3513	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	10
	3355	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	10
	3350	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	8
	3196	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	10
	3146	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	3140	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	10
	3136	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	5
	3133	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	10
	3118	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	10
	3112	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	3110	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	10
	3082	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	5
	3076	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	10
	3006	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	8
	2969	P1408F Two Different constructive algorithms divide and conquer *2300	1 / 2	8
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2926	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	2915	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2899	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	10
	2894	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	9
	2884	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	10
	2858	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2812	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	2807	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	2799	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2717	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	2679	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	2616	P1470F Strange Covering divide and conquer *3500	0 / 0	10
	2516	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2466	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	4
	2450	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	9
	2422	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2351	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	10
	2198	P1523G Try Booking data structures divide and conquer *3200	0 / 1	10
	2169	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	2168	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	2051	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	2035	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	6
	2028	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	6
	2024	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	10
	2009	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	1959	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	10
	1957	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	10
	1874	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	8
	1797	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	7
	1762	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	10
	1737	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	9
	1734	P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	10
	1640	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1629	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	10
	1574	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1542	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	10
	1528	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	10
	1520	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1499	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	9
	1460	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	9
	1396	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	10
	1354	P1641E Special Positions combinatorics divide and conquer fft math *3300	0 / 0	10
	1329	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1328	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	10
	1306	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1304	P1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	10

Pick a problem randomly based on the current filter.