Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2885	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	2884	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	2883	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	2878	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	2877	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	2876	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	2868	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	10
	2863	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	2861	P1369F BareLee dfs and similar dp games *2700	0 / 0	10
	2857	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	2848	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	2843	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	2842	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	10
	2837	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	5
	2836	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8
	2815	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	2813	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	2808	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	2805	P1380F Strange Addition data structures dp matrices *2600	0 / 0	10
	2801	P1381B Unmerge dp *1800	0 / 0	6
	2799	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	2796	P1382B Sequential Nim dp games *1100	0 / 0	3
	2794	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	2793	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	2791	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	2788	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	2787	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	8
	2783	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	5
	2776	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	2775	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	2773	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	10
	2766	P1389B Array Walk brute force dp greedy *1600	0 / 0	5
	2765	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	2762	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	2761	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	2758	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	5
	2757	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	2752	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	5
	2749	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	2748	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	10
	2743	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	2742	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	2741	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	2740	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	2737	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	10
	2733	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	2730	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	8
	2723	P1398C Good Subarrays data structures dp math *1600	0 / 0	5
	2722	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	6
	2720	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	2712	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	2707	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	8
	2706	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	2705	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	2701	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2696	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	10
	2693	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	10
	2691	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2684	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	2677	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	8
	2676	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2673	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	2672	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2669	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2667	P1408I Bitwise Magic dp math *3200	0 / 0	10
	2662	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2661	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2651	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	2645	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	4
	2642	P1415F Cakes for Clones dp *2900	0 / 0	10
	2639	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2637	P1416E Split binary search data structures dp greedy *3200	0 / 0	10
	2631	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	5
	2617	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	2616	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2614	P1420E Battle Lemmings dp greedy *2500	0 / 0	9
	2609	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	10
	2606	P1422C Bargain combinatorics dp math *1700	0 / 0	5
	2604	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	10
	2593	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	9
	2585	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	10
	2583	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	8
	2573	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2570	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	2559	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2558	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	10
	2557	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	10
	2550	P1430F Realistic Gameplay dp greedy *2600	0 / 0	10
	2549	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2542	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	2539	P1431J Zero-XOR Array special problem dp 3400	0 / 0	10
	2533	P1433F Zero Remainder Sum dp *2100	0 / 0	7
	2522	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2520	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	2519	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	10
	2507	P1439D INOI Final Contests combinatorics dp fft *3100	0 / 0	10
	2503	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	6
	2500	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2499	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2496	P1443B Saving the City dp greedy math sortings *1300	0 / 0	4

Pick a problem randomly based on the current filter.