dfs and similar - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2324	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2321	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	10
	2309	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	10
	2258	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	10
	2257	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	10
	2236	P1517C Fillomino 2 constructive algorithms dfs and similar greedy implementation *1400	0 / 0	4
	2224	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	10
	2223	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2213	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *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
	2171	P1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	9
	2168	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	2164	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	8
	2131	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	2128	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	2118	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	9
	2116	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	10
	2106	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	6
	2085	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2054	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	2033	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	7
	2020	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1992	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	8
	1984	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	6
	1978	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	10
	1975	P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	10
	1965	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	7
	1949	P1554E You dfs and similar dp math number theory *2600	0 / 0	10
	1923	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1917	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	9
	1906	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1905	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1889	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1871	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	10
	1859	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	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
	1814	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	10
	1806	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	6
	1782	P1578J Just Kingdom brute force data structures dfs and similar *3100	0 / 0	10
	1738	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1715	P1585E Frequency Queries data structures dfs and similar trees *2400	0 / 0	9
	1705	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5
	1704	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	8
	1696	P1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	3
	1691	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	5
	1690	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1682	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	5
	1677	P1598A Computer Game brute force dfs and similar dp implementation *800	0 / 0	3
	1669	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1646	P1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	4
	1642	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	1635	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	10
	1620	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	1602	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	8
	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
	1566	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	10
	1564	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	10
	1558	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	5
	1557	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1543	P1613E Crazy Robot dfs and similar graphs *2000	1 / 1	7
	1532	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	8
	1531	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	1521	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	1514	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1508	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	7
	1500	P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	7
	1489	P1621C Hidden Permutations dfs and similar interactive math *1700	0 / 0	5
	1484	P1621H Trains and Airplanes dfs and similar graphs shortest paths trees *3500	0 / 0	10
	1475	P1623B Game on Ranges brute force dfs and similar implementation sortings *1100	0 / 0	3
	1472	P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	9
	1465	P1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	6
	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
	1459	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
	1454	P1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	9
	1449	P1627C Not Assigning constructive algorithms dfs and similar number theory trees *1400	0 / 0	4
	1403	P1632E1 Distance Tree (easy version) binary search data structures dfs and similar graphs shortest paths trees *2400	0 / 0	9
	1402	P1632E2 Distance Tree (hard version) binary search dfs and similar shortest paths trees *2700	0 / 0	10
	1397	P1633E Spanning Tree Queries binary search data structures dfs and similar dsu graphs greedy math sortings trees *2400	0 / 0	9
	1391	P1634E Fair Share constructive algorithms data structures dfs and similar graph matchings graphs *2400	0 / 0	9
	1385	P1635E Cars 2-sat constructive algorithms dfs and similar dsu graphs greedy sortings *2200	0 / 0	8
	1378	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	9
	1341	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	1334	P1647E Madoka and the Sixth-graders data structures dfs and similar greedy *2500	0 / 0	9
	1328	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	10
	1327	P1648F Two Avenues data structures dfs and similar graphs *3500	0 / 0	10
	1318	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	1314	P1651D Nearest Excluded Points binary search data structures dfs and similar graphs shortest paths *1900	0 / 0	6
	1313	P1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	10
	1308	P1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	7
	1305	P1654G Snowy Mountain data structures dfs and similar graphs greedy shortest paths trees *2900	0 / 0	10
	1299	P1656E Equal Tree Sums constructive algorithms dfs and similar math trees *2200	0 / 0	8
	1289	P1657F Words on Tree 2-sat dfs and similar dsu graphs trees *2600	0 / 0	10
	1277	P1659E AND-MEX Walk bitmasks brute force constructive algorithms dfs and similar dsu graphs *2200	0 / 0	8
	1276	P1659F Tree and Permutation Game dfs and similar games graphs trees *3000	0 / 0	10
	1267	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1257	P1662F Antennas data structures dfs and similar graphs graphs implementation implementation shortest paths shortest paths	0 / 0	(None)
	1248	P1662O Circular Maze brute force dfs and similar graphs implementation	0 / 0	(None)
	1223	P1666L Labyrinth dfs and similar graphs *1800	0 / 0	6
	1219	P1667D Edge Elimination constructive algorithms dfs and similar dp trees *2900	0 / 0	10

Pick a problem randomly based on the current filter.