dp - Problem Set - HFOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3183	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	3182	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	3177	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	3176	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	3175	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	3167	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	10
	3162	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	3160	P1369F BareLee dfs and similar dp games *2700	0 / 0	10
	3156	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	3147	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	3142	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	3141	P1372E Omkar and Last Floor dp greedy two pointers *2900	1 / 1	10
	3136	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	5
	3135	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8
	3114	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3112	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	3107	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	3104	P1380F Strange Addition data structures dp matrices *2600	0 / 0	10
	3100	P1381B Unmerge dp *1800	0 / 0	6
	3098	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	3095	P1382B Sequential Nim dp games *1100	0 / 0	3
	3093	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	3092	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	3090	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	3087	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	3086	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	8
	3082	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	5
	3075	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	3074	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	3072	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	10
	3065	P1389B Array Walk brute force dp greedy *1600	0 / 0	5
	3064	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	3061	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	3060	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	3057	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	5
	3056	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	3051	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	5
	3048	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	3047	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	10
	3042	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	3041	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	3040	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	3039	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	3036	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	1 / 3	10
	3032	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	3029	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	8
	3022	P1398C Good Subarrays data structures dp math *1600	0 / 0	5
	3021	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	6
	3019	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	3011	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	3006	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	8
	3005	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	3004	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	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
	2992	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	10
	2990	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2983	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	2976	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	8
	2975	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2972	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	2971	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2968	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2966	P1408I Bitwise Magic dp math *3200	0 / 0	10
	2961	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2960	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2950	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	2944	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	4
	2941	P1415F Cakes for Clones dp *2900	0 / 0	10
	2938	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2936	P1416E Split binary search data structures dp greedy *3200	0 / 0	10
	2930	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	5
	2916	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	2915	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2913	P1420E Battle Lemmings dp greedy *2500	0 / 0	9
	2908	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	10
	2905	P1422C Bargain combinatorics dp math *1700	0 / 0	5
	2903	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	10
	2892	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	9
	2884	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	10
	2882	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	8
	2872	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2869	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	2858	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2857	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	10
	2856	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	10
	2849	P1430F Realistic Gameplay dp greedy *2600	0 / 0	10
	2848	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2841	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	2838	P1431J Zero-XOR Array special problem dp 3400	0 / 0	10
	2832	P1433F Zero Remainder Sum dp *2100	0 / 0	7
	2821	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2819	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	2818	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	10
	2806	P1439D INOI Final Contests combinatorics dp fft *3100	0 / 0	10
	2802	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	6
	2799	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2798	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2795	P1443B Saving the City dp greedy math sortings *1300	0 / 0	4
	2789	P1444D Rectangular Polyline constructive algorithms dp geometry *2900	0 / 0	10

Pick a problem randomly based on the current filter.