dfs and similar - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3586	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	7
	3580	P1305D Kuroni and the Celebration constructive algorithms dfs and similar interactive trees *1900	0 / 0	6
	3572	P1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	6
	3570	P1307F Cow and Vacation dfs and similar dsu trees *3300	0 / 0	10
	3554	P1311B WeirdSort dfs and similar sortings *1200	0 / 0	4
	3536	P1312G Autocompletion data structures dfs and similar dp *2600	0 / 0	10
	3518	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 1	7
	3509	P1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	5
	3503	P1320E Treeland and Viruses data structures dfs and similar dp shortest paths trees *3000	0 / 0	10
	3479	P1324C Frog Jumps binary search data structures dfs and similar greedy implementation *1100	0 / 0	3
	3476	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	6
	3473	P1325C Ehab and Path-etic MEXs constructive algorithms dfs and similar greedy trees *1500	0 / 0	5
	3469	P1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	10
	3467	P1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	9
	3447	P1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	8
	3433	P1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	6
	3407	P1331E Jordan Smiley *special problem dfs and similar geometry implementation	0 / 0	(None)
	3397	P1332C K-Complete Word dfs and similar dsu greedy implementation strings *1500	0 / 0	5
	3393	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	9
	3362	P1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	8
	3361	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	5
	3351	P1338B Edge Weight Assignment bitmasks constructive algorithms dfs and similar greedy math trees *1800	0 / 0	6
	3349	P1338D Nested Rubber Bands constructive algorithms dfs and similar dp math trees *2700	0 / 0	10
	3343	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	9
	3342	P1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	10
	3324	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	7
	3323	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	10
	3303	P1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	10
	3300	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	7
	3285	P1352F Binary String Reconstruction constructive algorithms dfs and similar math *1500	0 / 0	5
	3272	P1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	7
	3213	P1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	3211	P1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	10
	3202	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	7
	3197	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	1 / 1	7
	3192	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	5
	3177	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	3161	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	9
	3160	P1369F BareLee dfs and similar dp games *2700	0 / 0	10
	3154	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	3153	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	3119	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	3114	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3098	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	3081	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	3079	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	8
	3075	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	3073	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	9
	3069	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	6
	3068	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	3060	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	3055	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	3048	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	3042	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	3038	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	3027	P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	10
	3013	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	3012	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	3005	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	3000	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2995	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	10
	2993	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2990	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2988	P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	10
	2982	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	5
	2975	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2957	P1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	5
	2919	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2848	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2834	P1433D Districts Connection constructive algorithms dfs and similar *1200	0 / 0	4
	2826	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2800	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	9
	2798	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2790	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	9
	2788	P1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	10
	2780	P1446E Long Recovery constructive algorithms dfs and similar *3500	0 / 0	10
	2771	P1450E Capitalism constructive algorithms dfs and similar graphs shortest paths *2700	0 / 0	10
	2753	P1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	10
	2748	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2742	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	7
	2692	P1463E Plan of Lectures constructive algorithms dfs and similar dsu graphs implementation sortings trees *2400	0 / 0	9
	2680	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2667	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	9
	2620	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	8
	2602	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2569	P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	5
	2568	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2555	P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	10
	2505	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2496	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	10
	2493	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	5
	2466	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	4
	2450	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	9
	2436	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	9
	2422	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2418	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	10
	2413	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	10
	2386	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	2384	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	9
	2376	P1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	9

Pick a problem randomly based on the current filter.