Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1241	P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6
	1240	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	1239	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	10
	1234	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1229	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1228	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	1227	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1205	P1686B Odd Subarrays dp greedy *800	0 / 0	3
	1193	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	1192	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	1178	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	1171	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	1170	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	1168	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1166	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1159	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1158	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1157	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1148	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	1143	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	1131	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	1130	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	1126	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	1124	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	1119	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	1104	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	1103	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	1098	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	1097	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	10
	1095	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	10
	1086	P1706B Making Towers dp greedy math *1100	0 / 0	3
	1085	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	1083	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	1078	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	1076	P1707F Bugaboo bitmasks constructive algorithms dp number theory *3500	0 / 0	10
	1072	P1709B Also Try Minecraft data structures dp implementation *900	0 / 0	3
	1068	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	1065	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	1051	P1713C Build Permutation constructive algorithms dp math *1200	0 / 0	4
	1048	P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	10
	1044	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	1036	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	1032	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	1031	P1716D Chip Move brute force dp math *2000	0 / 0	7
	1030	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	1029	P1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	9
	1022	P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	6
	1021	P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	6
	1009	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	1008	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	1002	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	996	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	989	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	984	P1725J Journey dp trees *2500	0 / 0	9
	981	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	6
	969	P1728D Letter Picking constructive algorithms dp games two pointers *1800	0 / 0	6
	966	P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	959	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	953	P1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	10
	949	P1731D Valiant's New Map binary search brute force data structures dp two pointers *1700	0 / 0	5
	948	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	947	P1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	9
	945	P1732B Ugu brute force dp greedy implementation *900	0 / 0	3
	940	P1732E Location data structures dp math number theory *2800	0 / 0	10
	935	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	934	P1733E Conveyor constructive algorithms dp math *2700	0 / 0	10
	930	P1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	6
	928	P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	9
	918	P1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	9
	916	P1736E Swap and Take dp greedy *2600	0 / 0	10
	912	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	911	P1737E Ela Goes Hiking combinatorics dp math probabilities *2500	0 / 0	9
	906	P1738C Even Number Addicts dp games greedy math *1500	0 / 0	5
	904	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	902	P1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	10
	898	P1739C Card Game combinatorics constructive algorithms dp games *1500	0 / 0	5
	896	P1739E Cleaning Robot bitmasks dp *2400	0 / 0	9
	895	P1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	10
	890	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	889	P1740F Conditional Mix combinatorics dp math *2600	0 / 0	10
	886	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	881	P1741E Sending a Sequence Over the Network dp *1600	0 / 0	5
	879	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	869	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	868	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	867	P1743E FTL binary search dp *2400	0 / 0	9
	866	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	865	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	10
	854	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	852	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	10
	850	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	845	P1747E List Generation combinatorics dp math *2900	0 / 0	10
	842	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	840	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	835	P1749D Counting Arrays combinatorics dp math number theory *1900	0 / 0	6
	828	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	827	P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	826	P1750G Doping combinatorics dp math *3300	0 / 0	10
	825	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	824	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	4

Pick a problem randomly based on the current filter.