*2100 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2774	P1450C1 Errich-Tac-Toe (Easy Version) constructive algorithms math *2100	0 / 0	7
	2741	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2680	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2603	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2602	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2539	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2516	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2498	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2432	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	1 / 2	7
	2380	P1499D The Number of Pairs dp math number theory *2100	0 / 0	7
	2308	P1510D Digits dp math number theory *2100	0 / 0	7
	2291	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2245	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2190	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	7
	2149	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2080	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	2078	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	2033	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	1997	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	7
	1965	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1943	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7
	1905	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 1	7
	1797	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	7
	1690	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1669	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1652	P1599H Hidden Fortress interactive math *2100	0 / 0	7
	1620	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	1612	P1606E Arena combinatorics dp math *2100	0 / 0	7
	1538	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	1488	P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	7
	1455	P1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	7
	1435	P1628D1 Game on Sum (Easy Version) combinatorics dp games math *2100	0 / 0	7
	1379	P1637E Best Pair binary search brute force implementation *2100	0 / 0	7
	1318	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	1308	P1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	7
	1269	P1660F2 Promising String (hard version) data structures implementation math strings *2100	0 / 0	7
	1225	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	7
	1221	P1667B Optimal Partition data structures dp *2100	0 / 0	7
	1196	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1118	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	918	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	840	P1725F Field Photography bitmasks data structures sortings *2100	0 / 0	7
	811	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	795	P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	781	P1734E Rectangular Congruence constructive algorithms number theory *2100	0 / 0	7
	651	P1748D ConstructOR bitmasks chinese remainder theorem combinatorics constructive algorithms math number theory *2100	0 / 0	7
	560	P1761D Carry Bit combinatorics math *2100	0 / 0	7
	552	P1762D GCD Queries constructive algorithms interactive number theory *2100	0 / 11	7
	477	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	441	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	400	P1775E The Human Equation greedy implementation *2100	0 / 0	7
	387	P1776G Another Wine Tasting Event combinatorics constructive algorithms math strings *2100	0 / 0	7
	361	P1778D Flexible String Revisit combinatorics dp math probabilities *2100	0 / 0	7
	298	P1787E The Harmonization of XOR bitmasks constructive algorithms greedy math *2100	0 / 0	7
	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
	186	P1799D2 Hot Start Up (hard version) data structures dp *2100	0 / 0	7
	160	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	106	P1808D Petya, Petya, Petr, and Palindromes binary search brute force data structures two pointers *2100	0 / 0	7
	77	P1810E Monsters brute force data structures dfs and similar dsu graphs greedy *2100	0 / 0	7
	61	P1811F Is It Flower? dfs and similar graphs implementation *2100	0 / 0	7
	59	P1811G1 Vlad and the Nice Paths (easy version) combinatorics dp math *2100	0 / 0	7
	9809	P1832D1 Red-Blue Operations (Easy Version) binary search greedy implementation math *2100	0 / 0	7
	9869	P1838D Bracket Walk data structures greedy strings *2100	0 / 0	7
	9863	P1839D Ball Sorting data structures dp sortings *2100	0 / 0	7
	9991	P1856D More Wrong divide and conquer interactive *2100	0 / 0	7
	10214	P1896E Permutation Sorting data structures sortings *2100	0 / 0	7
	10192	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	10302	P1910E Maximum Sum Subarrays special problem dp 2100	0 / 0	7
	10236	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	10226	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	10274	P1919D 01 Tree constructive algorithms data structures dsu greedy sortings trees *2100	0 / 0	7
	10264	P1920E Counting Binary Strings combinatorics dp math *2100	0 / 0	7
	10339	P1924B Space Harbour data structures implementation math sortings *2100	0 / 0	7
	10429	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings *2100	0 / 0	7
	10404	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths *2100	0 / 0	7
	10399	P1934D1 XOR Break — Solo Version bitmasks constructive algorithms greedy *2100	0 / 0	7
	10596	P1970B2 Exact Neighbours (Medium) constructive algorithms *2100	0 / 0	7
	10591	P1970D1 Arithmancy (Easy) brute force constructive algorithms interactive strings *2100	0 / 0	7
	10572	P1971H ±1 2-sat dfs and similar graphs *2100	0 / 0	7
	10552	P1975E Chain Queries binary search data structures dfs and similar implementation trees *2100	0 / 0	7

Pick a problem randomly based on the current filter.