Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	823	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	5
	821	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	805	P1759E The Humanoid brute force dp sortings *1500	0 / 0	5
	790	P1761F1 Anti-median (Easy Version) dp math *3100	0 / 0	10
	789	P1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	10
	782	P1762F Good Pairs binary search data structures dp *2600	0 / 0	10
	777	P1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	8
	776	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
	775	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	771	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	770	P1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	9
	762	P1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	10
	759	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	748	P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	746	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	742	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	741	P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	740	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	733	P1768F Wonderful Jump dp greedy *2900	0 / 0	10
	728	P1770E Koxia and Tree combinatorics dfs and similar dp dsu math probabilities trees *2400	0 / 0	9
	727	P1770F Koxia and Sequence bitmasks combinatorics dp math number theory *3100	0 / 0	10
	723	P1771B Hossam and Friends binary search constructive algorithms dp two pointers *1400	0 / 0	4
	721	P1771D Hossam and (sub-)palindromic tree brute force data structures dfs and similar dp strings trees *2100	0 / 0	7
	720	P1771E Hossam and a Letter brute force dp implementation two pointers *2500	0 / 0	9
	712	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	707	P1773L Lisa's Sequences dp *3500	0 / 0	10
	704	P1774C Ice and Fire constructive algorithms dp greedy *1300	0 / 0	4
	702	P1774E Two Chess Pieces dfs and similar dp greedy trees *1900	0 / 0	6
	699	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
	691	P1775F Laboratory on Pluto constructive algorithms dp greedy math *2500	0 / 0	9
	689	P1776B Vittorio Plays with LEGO Bricks dp geometry *2200	0 / 0	8
	686	P1776E Crossing the Railways data structures dp *3500	0 / 0	10
	680	P1776K Uniform Chemistry dp math *3200	0 / 0	10
	678	P1776M Parmigiana With Seafood binary search dp greedy trees *3000	0 / 0	10
	673	P1777D Score of a Tree bitmasks combinatorics dfs and similar dp math probabilities trees *1900	0 / 0	6
	667	P1778D Flexible String Revisit combinatorics dp math probabilities *2100	0 / 0	7
	665	P1778F Maximizing Root dfs and similar dp graphs math number theory trees *2600	0 / 0	10
	661	P1779D Boris and His Amazing Haircut constructive algorithms data structures dp dsu greedy sortings *1700	0 / 0	5
	659	P1779F Xorcerer's Stones bitmasks constructive algorithms dp trees *2500	0 / 0	9
	652	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	645	P1781F Bracket Insertion combinatorics dp math trees *2700	0 / 0	10
	638	P1783D Different Arrays brute force dp implementation *2000	0 / 0	7
	631	P1784D Wooden Spoon combinatorics dp *2400	0 / 0	9
	630	P1784E Infinite Game brute force combinatorics dp games probabilities *3100	0 / 0	10
	623	P1787C Remove the Bracket dp greedy math *1600	0 / 0	5
	618	P1787H Codeforces Scoreboard binary search data structures dp geometry *3300	0 / 0	10
	612	P1788E Sum Over Zero data structures dfs and similar dp *2200	0 / 0	8
	608	P1789C Serval and Toxel's Arrays combinatorics dp implementation math *1500	0 / 0	5
	606	P1789E Serval and Music Game brute force dp implementation math number theory *2500	0 / 0	9
	605	P1789F Serval and Brain Power bitmasks brute force dp greedy implementation strings *2700	0 / 0	10
	593	P1791E Negatives and Positives dp greedy sortings *1100	0 / 0	3
	585	P1792E Divisors and Table brute force dfs and similar dp number theory *2400	0 / 0	9
	584	P1792F1 Graph Coloring (easy version) combinatorics dp graphs *2700	0 / 0	10
	583	P1792F2 Graph Coloring (hard version) brute force combinatorics divide and conquer dp fft graphs *2900	0 / 0	10
	579	P1793D Moscow Gorillas binary search dp greedy implementation math two pointers *1800	0 / 0	6
	578	P1793E Velepin and Marketing binary search data structures dp greedy sortings two pointers *2600	0 / 0	10
	573	P1794D Counting Factorizations combinatorics divide and conquer dp math number theory *1900	0 / 0	6
	572	P1794E Labeling the Tree with Distances data structures dp greedy hashing implementation trees *2400	0 / 0	9
	567	P1795E Explosions? binary search data structures dp greedy math *2200	0 / 0	8
	561	P1796D Maximum Subarray data structures dp greedy two pointers *2000	0 / 0	7
	560	P1796E Colored Subgraphs dfs and similar dp games greedy trees *2500	0 / 0	9
	555	P1797D Li Hua and Tree brute force data structures dfs and similar dp implementation trees *1900	0 / 0	6
	548	P1798E Multitest Generator brute force dp *2300	0 / 0	8
	547	P1798F Gifts from Grandfather Ahmed dp math number theory *2500	0 / 0	9
	543	P1799D1 Hot Start Up (easy version) dp *1900	0 / 0	6
	542	P1799D2 Hot Start Up (hard version) data structures dp *2100	0 / 0	7
	540	P1799F Halve or Subtract binary search brute force dp greedy sortings *2700	0 / 0	10
	539	P1799G Count Voting combinatorics dp math *2600	0 / 0	10
	538	P1799H Tree Cutting bitmasks dfs and similar dp *3200	0 / 0	10
	526	P1801C Music Festival binary search data structures dp greedy sortings *1900	0 / 0	6
	525	P1801D The way home binary search data structures dp graphs greedy shortest paths sortings *2100	0 / 0	7
	523	P1801F Another n-dimensional chocolate bar dp math meet-in-the-middle number theory *2700	0 / 0	10
	516	P1804D Accommodation brute force dp greedy implementation *2000	0 / 0	7
	515	P1804E Routing bitmasks brute force dfs and similar dp graphs *2400	0 / 0	9
	512	P1804H Code Lock bitmasks dp *3300	0 / 0	10
	508	P1805D A Wide, Wide Graph dfs and similar dp graphs greedy trees *1800	0 / 0	6
	507	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	501	P1806D DSU Master combinatorics dp dsu math *2500	0 / 0	9
	491	P1807G1 Subsequence Addition (Easy Version) brute force data structures dp greedy implementation sortings *1100	0 / 0	3
	490	P1807G2 Subsequence Addition (Hard Version) bitmasks dp greedy implementation sortings *1100	0 / 0	3
	487	P1808C Unlucky Numbers brute force dp greedy implementation *1900	0 / 0	6
	485	P1808E1 Minibuses on Venus (easy version) combinatorics divide and conquer dp *2200	0 / 0	8
	484	P1808E2 Minibuses on Venus (medium version) combinatorics divide and conquer dp matrices *2500	0 / 0	9
	483	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	478	P1809E Two Tanks binary search dp implementation math *2400	0 / 0	9
	476	P1809G Prediction combinatorics dp math *2800	0 / 0	10
	469	P1810G The Maximum Prefix dp *3200	0 / 0	10
	463	P1811E Living Sequence binary search dp math number theory *1500	0 / 0	5
	461	P1811G1 Vlad and the Nice Paths (easy version) combinatorics dp math *2100	0 / 0	7
	460	P1811G2 Vlad and the Nice Paths (hard version) binary search combinatorics data structures dp math two pointers *2200	0 / 0	8
	445	P1814E Chain Chips data structures dp matrices *2300	0 / 0	8
	440	P1815D XOR Counting bitmasks combinatorics dp math *2600	0 / 0	10
	439	P1815E Bosco and Particle dp math number theory strings *3100	0 / 0	10
	425	P1819C The Fox and the Complete Tree Traversal constructive algorithms dp implementation math trees *2400	0 / 0	9
	424	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	10
	422	P1819F Willy-nilly, Crack, Into Release! data structures dp *3500	0 / 0	10
	415	P1821E Rearrange Brackets brute force dp greedy sortings strings *2100	0 / 0	7
	414	P1821F Timber combinatorics dp fft math *2600	0 / 0	10
	408	P1822F Gardening Friends brute force dfs and similar dp graphs trees *1700	0 / 0	5
	401	P1823E Removing Graph brute force dp games graphs math *2500	0 / 0	9

Pick a problem randomly based on the current filter.