Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1738	P1592C Bakry and Partitioning bitmasks constructive algorithms dfs and similar dp graphs trees *1700	0 / 0	5
	1732	P1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	3
	1727	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	7
	1726	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1722	P1594D The Number of Imposters constructive algorithms dfs and similar dp dsu graphs *1700	0 / 0	5
	1720	P1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	8
	1718	P1598A Computer Game brute force dfs and similar dp implementation *800	0 / 0	3
	1716	P1598C Delete Two Elements data structures dp implementation math two pointers *1200	0 / 0	4
	1714	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	7
	1713	P1598F RBS binary search bitmasks brute force data structures dp *2400	0 / 0	9
	1697	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	6
	1696	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1695	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	10
	1694	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	10
	1688	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	8
	1687	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	10
	1686	P1603E A Perfect Problem combinatorics dp math *3200	0 / 0	10
	1685	P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	10
	1677	P1605F PalindORme combinatorics dp *2900	0 / 0	10
	1672	P1606E Arena combinatorics dp math *2100	0 / 0	7
	1671	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	1660	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	1657	P1608F MEX counting combinatorics dp implementation *3200	0 / 0	10
	1653	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	4
	1651	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	9
	1644	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	7
	1633	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1626	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1625	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1620	P1613D MEX Sequences dp math *1900	0 / 0	6
	1615	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	5
	1614	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	7
	1613	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	8
	1606	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1600	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1597	P1616G Just Add an Edge dfs and similar dp graphs *3500	0 / 0	10
	1596	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	10
	1590	P1617E Christmas Chocolates dfs and similar dp games graphs implementation math number theory shortest paths trees *2700	0 / 0	10
	1586	P1618D Array and Operations dp greedy math *1300	0 / 0	4
	1578	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	5
	1572	P1620C BA-String brute force dp greedy implementation math *1800	0 / 0	6
	1569	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1568	P1620G Subsequences Galore bitmasks combinatorics dp *2400	0 / 0	9
	1563	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1561	P1621G Weighted Increasing Subsequences data structures dp math *3200	0 / 0	10
	1543	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	7
	1538	P1625C Road Optimization dp *1700	0 / 0	5
	1536	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	9
	1532	P1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	5
	1529	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	10
	1525	P1627D Not Adding brute force dp math number theory *1900	0 / 0	6
	1524	P1627E Not Escaping data structures dp implementation shortest paths two pointers *2200	0 / 0	8
	1519	P1628D1 Game on Sum (Easy Version) combinatorics dp games math *2100	0 / 0	7
	1518	P1628D2 Game on Sum (Hard Version) combinatorics dp games math *2400	0 / 0	9
	1511	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	1510	P1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	9
	1506	P1631B Fun with Even Subarrays dp greedy *1100	0 / 0	3
	1503	P1632C Strange Test binary search bitmasks brute force dp math *1600	0 / 0	5
	1496	P1633D Make Them Equal dp greedy *1600	0 / 0	5
	1484	P1635D Infinite Set bitmasks dp math matrices number theory strings *1800	0 / 0	6
	1480	P1637B MEX and Array brute force dp greedy math *1100	0 / 0	3
	1478	P1637D Yet Another Minimization Problem dp greedy math *1800	0 / 0	6
	1476	P1637F Towers constructive algorithms dfs and similar dp greedy trees *2500	0 / 0	9
	1446	P1644C Increase Subarray Sums brute force dp greedy implementation *1400	0 / 0	4
	1440	P1646C Factorials and Powers of Two bitmasks brute force constructive algorithms dp math *1500	0 / 0	5
	1439	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	7
	1438	P1646E Power Board brute force dp math number theory *2200	0 / 0	8
	1433	P1647D Madoka and the Best School in Russia constructive algorithms dp math number theory *1900	0 / 0	6
	1431	P1647F Madoka and Laziness dp greedy *3100	0 / 0	10
	1427	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	1417	P1650F Vitaly and Advanced Useless Algorithms dp greedy implementation *2200	0 / 0	8
	1416	P1650G Counting Shortcuts data structures dfs and similar dp graphs shortest paths *2100	0 / 0	7
	1402	P1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	10
	1388	P1657E Star MST combinatorics dp graph matchings math *2200	0 / 0	8
	1381	P1658E Gojou and Matrix Game data structures dp games hashing implementation math number theory sortings *2500	0 / 0	9
	1377	P1659C Line Empire binary search brute force dp greedy implementation math *1500	0 / 0	5
	1371	P1660C Get an Even String dp greedy strings *1300	0 / 0	4
	1365	P1661B Getting Zero bitmasks brute force dfs and similar dp graphs greedy shortest paths *1300	0 / 0	4
	1362	P1661E Narrow Components brute force data structures dp dsu math trees *2500	0 / 0	9
	1358	P1662C European Trip dp graphs math matrices	0 / 0	(None)
	1354	P1662G Gastronomic Event dp greedy trees	0 / 0	(None)
	1349	P1662L Il Derby della Madonnina data structures dp math	0 / 0	(None)
	1342	P1663D Is it rated - 3 *special problem combinatorics dp math	0 / 0	(None)
	1327	P1666F Fancy Stack combinatorics dp implementation *2200	0 / 0	8
	1323	P1666J Job Lookup constructive algorithms dp shortest paths trees *2100	0 / 0	7
	1319	P1667B Optimal Partition data structures dp *2100	0 / 0	7
	1317	P1667D Edge Elimination constructive algorithms dfs and similar dp trees *2900	0 / 0	10
	1316	P1667E Centroid Probabilities combinatorics dp fft math *3000	0 / 0	10
	1299	P1670F Jee, You See? bitmasks combinatorics dp *2400	0 / 0	9
	1294	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	7
	1293	P1671F Permutation Counting brute force combinatorics dp fft math *2700	0 / 0	10
	1280	P1673C Palindrome Basis brute force dp math number theory *1500	0 / 0	5
	1270	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	7
	1264	P1675F Vlad and Unfinished Business dfs and similar dp greedy trees *1800	0 / 0	6
	1263	P1675G Sorting Pancakes dp *2300	0 / 0	8
	1256	P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
	1253	P1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	5
	1250	P1677D Tokitsukaze and Permutations dp math *2500	0 / 0	9
	1248	P1677F Tokitsukaze and Gems dp math *3500	0 / 0	10
	1245	P1678B2 Tokitsukaze and Good 01-String (hard version) dp greedy implementation *1800	0 / 0	6

Pick a problem randomly based on the current filter.