Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2490	P1444D Rectangular Polyline constructive algorithms dp geometry *2900	0 / 0	10
	2489	P1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	10
	2485	P1446B Catching Cheaters dp strings *1800	0 / 0	6
	2484	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	2470	P1450G Communism bitmasks dp trees *3500	0 / 0	10
	2466	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2465	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2457	P1452D Radio Towers combinatorics dp math *1600	0 / 0	5
	2456	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2449	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2448	P1453F Even Harder dp *2700	0 / 0	10
	2438	P1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	5
	2436	P1455F String and Operations dp greedy *2800	0 / 0	10
	2435	P1455G Forbidden Value data structures dp *2900	0 / 0	10
	2434	P1456E XOR-ranges dp greedy *3500	0 / 0	10
	2432	P1458B Glass Half Spilled dp *2000	0 / 0	7
	2426	P1459B Move and Turn dp math *1300	0 / 0	4
	2424	P1461B Find the Spruce brute force dp implementation *1400	0 / 0	4
	2423	P1461C Random Events dp math probabilities *1500	0 / 0	5
	2420	P1461F Mathematical Expression constructive algorithms dp greedy *2700	0 / 0	10
	2418	P1462B Last Year's Substring dp implementation strings *800	0 / 0	3
	2407	P1463F Max Correct Set bitmasks dp math *3100	0 / 0	10
	2404	P1466B Last minute enhancements dp greedy *800	0 / 0	3
	2403	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2398	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	10
	2393	P1467D Sum of Paths combinatorics dp math *2200	0 / 0	8
	2392	P1467E Distinctive Roots in a Tree data structures dfs and similar dp trees *2500	0 / 0	9
	2391	P1468A LaIS data structures dp greedy *2200	0 / 0	8
	2376	P1469B Red and Blue dp greedy *1000	0 / 0	3
	2375	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	5
	2371	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2367	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2362	P1472B Fair Division dp greedy math *800	0 / 0	3
	2361	P1472C Long Jumps dp graphs *1100	0 / 0	3
	2360	P1472D Even-Odd Game dp games greedy sortings *1200	0 / 0	4
	2359	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5
	2358	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2357	P1472G Moving to the Capital dfs and similar dp graphs shortest paths *2100	0 / 0	7
	2353	P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2350	P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	2346	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2344	P1474F 1 2 3 4 ... dp math matrices *3000	0 / 0	10
	2342	P1475B New Year's Number brute force dp math *900	0 / 0	3
	2340	P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	2337	P1475G Strange Beauty dp math number theory sortings *1900	0 / 0	6
	2334	P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	5
	2333	P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	5
	2331	P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2322	P1478B Nezzar and Lucky Number brute force dp greedy math *1100	0 / 0	3
	2319	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2318	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2315	P1479E School Clubs dp fft math number theory probabilities *3500	0 / 0	10
	2308	P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2307	P1481F AB Tree dp greedy trees *3100	0 / 0	10
	2302	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2297	P1485B Replace and Keep Sorted dp implementation math *1200	0 / 0	4
	2294	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2293	P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	2288	P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2287	P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2286	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	10
	2280	P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2279	P1487G String Counting combinatorics dp fft math *2700	0 / 0	10
	2274	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2259	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2258	P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2250	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2239	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	2230	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	10
	2223	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	9
	2222	P1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	5
	2221	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	9
	2218	P1498C Planar Reflections brute force data structures dp *1600	0 / 0	5
	2217	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	2215	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	9
	2213	P1499B Binary Removals brute force dp greedy implementation *1000	0 / 0	3
	2211	P1499D The Number of Pairs dp math number theory *2100	0 / 0	7
	2210	P1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	9
	2209	P1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	9
	2202	P1500F Cupboards Jumps dp *3500	0 / 0	10
	2200	P1501B Napoleon Cake dp implementation sortings *900	0 / 0	3
	2197	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2195	P1503E 2-Coloring combinatorics dp math *3100	0 / 0	10
	2176	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2167	P1509C The Sports Festival dp greedy *1800	0 / 0	6
	2163	P1510D Digits dp math number theory *2100	0 / 0	7
	2159	P1510H Hard Optimization dp *3200	0 / 0	10
	2151	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2150	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2149	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 0	10
	2143	P1512F Education brute force dp greedy implementation *1900	0 / 0	6
	2142	P1512G Short Task brute force dp math number theory *1700	0 / 0	5
	2139	P1513C Add One dp matrices *1600	0 / 0	5
	2126	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	2120	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2119	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	5
	2118	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	2117	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	9
	2113	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	6
	2111	P1517F Reunion combinatorics dp trees *3200	0 / 0	10

Pick a problem randomly based on the current filter.