dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2788	P1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	10
	2784	P1446B Catching Cheaters dp strings *1800	0 / 0	6
	2783	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2769	P1450G Communism bitmasks dp trees *3500	0 / 0	10
	2765	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2764	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2756	P1452D Radio Towers combinatorics dp math *1600	0 / 0	5
	2755	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2748	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2747	P1453F Even Harder dp *2700	0 / 0	10
	2737	P1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	5
	2735	P1455F String and Operations dp greedy *2800	0 / 0	10
	2734	P1455G Forbidden Value data structures dp *2900	0 / 0	10
	2733	P1456E XOR-ranges dp greedy *3500	0 / 0	10
	2731	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2724	P1459B Move and Turn dp math *1300	0 / 0	4
	2721	P1461B Find the Spruce brute force dp implementation *1400	0 / 0	4
	2719	P1461C Random Events dp math probabilities *1500	0 / 0	5
	2713	P1461F Mathematical Expression constructive algorithms dp greedy *2700	0 / 0	10
	2709	P1462B Last Year's Substring dp implementation strings *800	0 / 0	3
	2690	P1463F Max Correct Set bitmasks dp math *3100	0 / 1	10
	2684	P1466B Last minute enhancements dp greedy *800	0 / 0	3
	2683	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2676	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	10
	2668	P1467D Sum of Paths combinatorics dp math *2200	0 / 0	8
	2667	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	9
	2666	P1468A LaIS data structures dp greedy *2200	0 / 0	8
	2636	P1469B Red and Blue dp greedy *1000	0 / 0	3
	2635	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	5
	2626	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2619	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2609	P1472B Fair Division dp greedy math *800	0 / 0	3
	2607	P1472C Long Jumps dp graphs *1100	0 / 0	3
	2605	P1472D Even-Odd Game dp games greedy sortings *1200	0 / 0	4
	2604	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	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
	2598	P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2595	P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	2590	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2588	P1474F 1 2 3 4 ... dp math matrices *3000	0 / 0	10
	2584	P1475B New Year's Number brute force dp math *900	0 / 0	3
	2581	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	2574	P1475G Strange Beauty dp math number theory sortings *1900	0 / 0	6
	2570	P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	5
	2569	P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	5
	2565	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2547	P1478B Nezzar and Lucky Number brute force dp greedy math *1100	0 / 0	3
	2541	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2539	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2533	P1479E School Clubs dp fft math number theory probabilities *3500	0 / 0	10
	2522	P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2521	P1481F AB Tree dp greedy trees *3100	0 / 0	10
	2516	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2509	P1485B Replace and Keep Sorted dp implementation math *1200	0 / 0	4
	2505	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2503	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	2498	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2497	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2496	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	10
	2490	P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2489	P1487G String Counting combinatorics dp fft math *2700	0 / 0	10
	2484	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2455	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2452	P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2438	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2424	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	2410	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	10
	2397	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	9
	2396	P1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	5
	2394	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	9
	2388	P1498C Planar Reflections brute force data structures dp *1600	0 / 0	5
	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
	2382	P1499B Binary Removals brute force dp greedy implementation *1000	0 / 0	3
	2380	P1499D The Number of Pairs dp math number theory *2100	0 / 0	7
	2379	P1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	9
	2376	P1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	9
	2362	P1500F Cupboards Jumps dp *3500	0 / 0	10
	2360	P1501B Napoleon Cake dp implementation sortings *900	0 / 0	3
	2354	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2352	P1503E 2-Coloring combinatorics dp math *3100	0 / 0	10
	2328	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2313	P1509C The Sports Festival dp greedy *1800	0 / 0	6
	2308	P1510D Digits dp math number theory *2100	0 / 0	7
	2300	P1510H Hard Optimization dp *3200	0 / 0	10
	2291	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2290	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2289	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 20	10
	2280	P1512F Education brute force dp greedy implementation *1900	0 / 0	6
	2277	P1512G Short Task brute force dp math number theory *1700	0 / 0	5
	2272	P1513C Add One dp matrices *1600	0 / 0	5
	2259	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	2248	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2246	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	5
	2245	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2242	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	9
	2234	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	6
	2231	P1517F Reunion combinatorics dp trees *3200	0 / 0	10
	2229	P1517H Fly Around the World dp geometry *3500	0 / 0	10

Pick a problem randomly based on the current filter.