*2200 - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2590	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2557	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	2506	P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	8
	2497	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2484	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2386	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	2385	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	2371	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	2354	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2343	P1505F Math special problem math 2200	0 / 0	8
	2340	P1505I Mysterious language again, seriously? special problem 2200	0 / 0	8
	2259	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	2214	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2213	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2180	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2105	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2086	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2085	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2059	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	2052	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	1992	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1980	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1937	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1929	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1916	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	8
	1897	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	8
	1874	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	8
	1802	P1575G GCD Festival math number theory *2200	0 / 0	8
	1801	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	8
	1798	P1575K Knitting Batik implementation math *2200	0 / 0	8
	1766	P1579G Minimal Coverage dp *2200	0 / 0	8
	1763	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	1738	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1689	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1600	P1607G Banquet Preparations 1 greedy *2200	0 / 0	8
	1598	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	8
	1532	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	1523	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1507	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	1478	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	8
	1446	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1419	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	1385	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
	1356	P1641C Anonymity Is Important binary search brute force data structures dsu greedy sortings *2200	0 / 0	8
	1340	P1646E Power Board brute force dp math number theory *2200	0 / 0	8
	1319	P1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	8
	1299	P1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	8
	1290	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1277	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
	1229	P1666F Fancy Stack combinatorics dp implementation *2200	0 / 0	8
	1226	P1666I Interactive Treasure Hunt brute force constructive algorithms geometry interactive math *2200	0 / 0	8
	1202	P1670E Hemose on the Tree bitmasks constructive algorithms dfs and similar trees *2200	0 / 0	8
	1190	P1672E notepad.exe binary search constructive algorithms greedy interactive *2200	0 / 0	8
	1032	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	950	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	876	P1717E Madoka and The Best University math number theory *2200	0 / 0	8
	854	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	807	P1730D Prefixes and Suffixes constructive algorithms strings two pointers *2200	0 / 0	8
	769	P1736D Equal Binary Subsequences constructive algorithms geometry greedy implementation strings *2200	0 / 0	8
	762	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	720	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	539	P1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	8
	538	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
	507	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	504	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	433	P1773B BinCoin binary search divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	393	P1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	8
	369	P1777E Edge Reverse binary search dfs and similar graphs trees *2200	0 / 0	8
	311	P1784C Monsters (hard version) data structures greedy *2200	0 / 0	8
	285	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	278	P1789D Serval and Shift-Shift-Shift bitmasks brute force constructive algorithms implementation *2200	0 / 0	8
	224	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	166	P1800G Symmetree dfs and similar hashing implementation trees *2200	0 / 0	8
	128	P1806E Tree Master brute force data structures dfs and similar trees *2200	0 / 0	8
	104	P1808E1 Minibuses on Venus (easy version) combinatorics divide and conquer dp *2200	0 / 0	8
	60	P1811G2 Vlad and the Nice Paths (hard version) binary search combinatorics data structures dp math two pointers *2200	0 / 0	8
	45	P1815C Between constructive algorithms dfs and similar graphs greedy *2200	0 / 0	8
	9805	P1832E Combinatorics Problem brute force combinatorics dp *2200	0 / 0	8
	9856	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	9855	P1840G1 In Search of Truth (Easy Version) constructive algorithms interactive math meet-in-the-middle probabilities *2200	0 / 0	8
	9883	P1848D Vika and Bonuses binary search brute force math ternary search *2200	0 / 0	8
	10001	P1854B Earn or Unlock bitmasks brute force dp *2200	0 / 0	8
	9978	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	10205	P1898E Sofia and Strings data structures greedy sortings strings two pointers *2200	0 / 0	8
	10186	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	10317	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	10311	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	10247	P1912E Evaluate It and Back Again constructive algorithms implementation math *2200	0 / 0	8
	10343	P1918E ace5 and Task Order constructive algorithms divide and conquer implementation interactive probabilities sortings *2200	0 / 0	8
	10255	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	10452	P1946E Girl Permutation combinatorics dp math number theory *2200	0 / 0	8
	10620	P1967B2 Reverse Card (Hard Version) brute force math number theory *2200	0 / 0	8
	10607	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	10586	P1970E3 Trails (Hard) dp matrices *2200	0 / 0	8
	10581	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	10655	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	10648	P1986G1 Permutation Problem (Simple Version) binary search brute force combinatorics data structures math number theory *2200	0 / 0	8

Pick a problem randomly based on the current filter.