data structures - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2232	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	9
	2226	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	2219	P1520D Same Differences data structures hashing math *1200	0 / 0	4
	2214	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2209	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	9
	2205	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	5
	2198	P1523G Try Booking data structures divide and conquer *3200	0 / 1	10
	2196	P1523H Hopping Around the Array data structures dp *3500	0 / 0	10
	2192	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2183	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	5
	2182	P1526C2 Potions (Hard Version) data structures greedy *1600	0 / 0	5
	2180	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2169	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	2164	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	8
	2146	P1530H Turing's Award data structures dp *3400	0 / 0	10
	2135	P1533C Sweets *special problem data structures implementation	0 / 0	(None)
	2133	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)
	2129	P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
	2115	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	10
	2106	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	6
	2105	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2104	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2099	P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	5
	2098	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	2086	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2082	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	4
	2080	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	2073	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	2072	P1539F Strange Array data structures greedy sortings *2600	0 / 0	10
	2067	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10
	2046	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	10
	2045	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	10
	2044	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	10
	2036	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	5
	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
	2002	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	1983	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1980	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	8
	1964	P1553F Pairwise Modulo data structures math *2300	0 / 0	8
	1943	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	7
	1942	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	10
	1937	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1935	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	10
	1929	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1924	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	10
	1922	P1558F Strange Sort data structures sortings *3300	0 / 0	10
	1902	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	5
	1898	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	5
	1897	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	8
	1891	P1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	3
	1890	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	5
	1887	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	10
	1886	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	1874	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	8
	1863	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	6
	1845	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	9
	1841	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	10
	1838	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	6
	1830	P1572F Stations data structures *3400	0 / 0	10
	1818	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1813	P1575A Another Sorting Problem data structures sortings strings *1100	0 / 0	3
	1808	P1575C Cyclic Sum data structures fft number theory *3000	0 / 0	10
	1805	P1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	10
	1800	P1575I Illusions of the Desert data structures trees *2300	0 / 0	8
	1797	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	7
	1796	P1575M Managing Telephone Poles data structures geometry *2400	0 / 0	9
	1793	P1578B Building Forest Trails data structures dsu *2800	0 / 0	10
	1782	P1578J Just Kingdom brute force data structures dfs and similar *3100	0 / 0	10
	1768	P1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	5
	1765	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	5
	1763	P1580C Train Maintenance brute force data structures implementation *2200	0 / 0	8
	1761	P1580E Railway Construction brute force constructive algorithms data structures graphs shortest paths *3400	0 / 0	10
	1755	P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	4
	1753	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1749	P1582G Kuzya and Homework data structures number theory *2600	0 / 0	10
	1742	P1583C Omkar and Determination data structures dp *1700	0 / 0	5
	1735	P1583G Omkar and Time Travel data structures math *3000	0 / 0	10
	1734	P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	10
	1729	P1584E Game with Stones binary search data structures games greedy *2300	0 / 0	8
	1716	P1585D Yet Another Sorting Problem data structures math *1900	0 / 0	6
	1715	P1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	9
	1708	P1588F Jumping Through the Array binary search data structures graphs two pointers *3500	0 / 0	10
	1691	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	5
	1689	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1673	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	4
	1671	P1598D Training Session combinatorics data structures geometry implementation math *1700	0 / 0	5
	1669	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1667	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	9
	1655	P1599E Two Arrays data structures matrices *3200	0 / 0	10
	1651	P1599I Desert data structures graphs *2700	0 / 0	10
	1642	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	1640	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1639	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	10
	1636	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	10
	1592	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	1585	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	10
	1575	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9

Pick a problem randomly based on the current filter.