*2800 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4900	P1088F Ehab and a weird weight formula data structures trees *2800	0 / 0	10
	4827	P1098D Eels data structures *2800	0 / 0	10
	4767	P1109C Sasha and a Patient Friend binary search data structures implementation *2800	0 / 0	10
	4624	P1142D Foreigner dp *2800	0 / 0	10
	4565	P1152F1 Neko Rules the Catniverse (Small Version) bitmasks dp matrices *2800	0 / 0	10
	4545	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	10
	4262	P1208G Polygons greedy math number theory *2800	0 / 0	10
	4218	P1214H Tiles Placement constructive algorithms dfs and similar trees *2800	0 / 0	10
	4198	P1218A BubbleReactor dp graphs *2800	0 / 0	10
	3896	P1267D DevOps Best Practices constructive algorithms *2800	0 / 0	10
	3784	P1279F New Year and Handle Change binary search dp *2800	0 / 0	10
	3719	P1286C2 Madhouse (Hard version) brute force constructive algorithms hashing interactive math *2800	0 / 0	10
	3683	P1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	10
	3592	P1303F Number of Components dsu implementation *2800	0 / 0	10
	3564	P1310C Au Pont Rouge binary search dp strings *2800	0 / 0	10
	3513	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	10
	3491	P1322D Reality Show bitmasks dp *2800	0 / 0	10
	3443	P1327G Letters and Question Marks bitmasks dp string suffix structures *2800	0 / 0	10
	3189	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	10
	3146	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	3119	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	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
	3091	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	3090	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	3076	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	10
	3060	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	3041	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	3036	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	1 / 3	10
	3005	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	2988	P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	10
	2987	P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2947	P1413F Roads and Ramen data structures trees *2800	0 / 0	10
	2919	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2889	P1423M Milutin's Plums interactive *2800	0 / 0	10
	2878	P1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	10
	2824	P1436F Sum Over Subsets combinatorics math number theory *2800	0 / 0	10
	2799	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2735	P1455F String and Operations dp greedy *2800	0 / 0	10
	2595	P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	2555	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	10
	2478	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	10
	2447	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	10
	2303	P1510F Fiber Shape *2800	0 / 0	10
	2189	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2048	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	1928	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	10
	1835	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1794	P1578A Anti-Tetris constructive algorithms graphs shortest paths *2800	0 / 0	10
	1793	P1578B Building Forest Trails data structures dsu *2800	0 / 0	10
	1779	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	10
	1699	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1611	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	1588	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	10
	1574	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1549	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1530	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1493	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1459	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
	1453	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	10
	1396	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	10
	1384	P1635F Closest Pair data structures greedy *2800	0 / 0	10
	1329	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1306	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	1188	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	10
	1116	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1107	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	10
	1044	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1003	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
	991	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
	853	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	837	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10
	792	P1732E Location data structures dp math number theory *2800	0 / 0	10
	670	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	10
	637	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	502	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	480	P1766F MCF flows *2800	0 / 0	10
	429	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	391	P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	10
	314	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	100	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	87	P1809G Prediction combinatorics dp math *2800	0 / 0	10
	75	P1810F M-tree data structures math sortings trees *2800	0 / 0	10
	32	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	10
	9819	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	10
	9925	P1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	10
	9909	P1844F2 Min Cost Permutation (Hard Version) binary search constructive algorithms data structures greedy math sortings *2800	0 / 0	10
	9901	P1845F Swimmers in the Pool dp fft math number theory *2800	0 / 0	10
	9946	P1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	10
	10083	P1879F Last Man Standing brute force data structures number theory *2800	0 / 0	10
	10191	P1900F Local Deletions binary search data structures implementation *2800	0 / 0	10
	10234	P1913F Palindromic Problem binary search data structures hashing string suffix structures strings *2800	0 / 0	10
	10271	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	10391	P1935F Andrey's Tree binary search constructive algorithms data structures dfs and similar dsu greedy implementation trees *2800	0 / 0	10
	10470	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	10
	10618	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers *2800	0 / 0	10
	10743	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	10

Pick a problem randomly based on the current filter.