Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	400	P1823F Random Walk dp graphs math probabilities trees *2600	0 / 0	10
	396	P1824C LuoTianyi and XOR-Tree data structures dfs and similar dp dsu greedy trees *2500	0 / 0	9
	388	P1826D Running Miles brute force dp greedy *1700	0 / 0	5
	387	P1826E Walk the Runway bitmasks brute force data structures dp graphs implementation sortings *2400	0 / 0	9
	384	P1827B1 Range Sorting (Easy Version) binary search dp dsu greedy trees two pointers *2000	0 / 0	7
	383	P1827B2 Range Sorting (Hard Version) binary search data structures dp greedy *2400	0 / 0	9
	382	P1827C Palindrome Partition binary search brute force data structures dp hashing strings *2600	0 / 0	10
	373	P1829D Gold Rush brute force dfs and similar dp implementation *1000	0 / 0	3
	370	P1829G Hits Different data structures dp implementation math *1600	0 / 0	5
	369	P1829H Don't Blame Me bitmasks combinatorics dp math *1700	0 / 0	5
	368	P1830A Copil Copac Draws Trees dfs and similar dp graphs trees *1400	0 / 0	4
	365	P1830D Mex Tree brute force dp trees *2800	0 / 0	10
	363	P1830F The Third Grace data structures dp *3200	0 / 0	10
	355	P1832E Combinatorics Problem brute force combinatorics dp *2200	0 / 0	8
	354	P1832F Zombies binary search dp *3200	0 / 0	10
	347	P1833G Ksyusha and Chinchilla constructive algorithms dfs and similar dp dsu greedy implementation trees *1800	0 / 0	6
	336	P1835E Old Mobile combinatorics dp probabilities *3500	0 / 0	10
	322	P1838E Count Supersequences combinatorics dp math *2500	0 / 0	9
	317	P1839D Ball Sorting data structures dp sortings *2100	0 / 0	7
	316	P1839E Decreasing Game constructive algorithms dfs and similar dp greedy interactive *2400	0 / 0	9
	310	P1840F Railguns brute force dfs and similar dp graphs *2200	0 / 0	8
	305	P1841C Ranom Numbers brute force dp greedy math strings *1800	0 / 0	6
	299	P1842C Tenzing and Balls dp *1500	0 / 0	5
	297	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	295	P1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	10
	294	P1842H Tenzing and Random Real Numbers bitmasks dp graphs math probabilities *3000	0 / 0	10
	293	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	289	P1843D Apple Tree combinatorics dfs and similar dp math trees *1200	0 / 0	4
	287	P1843F1 Omsk Metro (simple version) data structures dfs and similar dp graphs greedy math trees *1800	0 / 0	6
	286	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	283	P1844C Particles dp greedy implementation math *1300	0 / 0	4
	277	P1844H Multiple of Three Cycles combinatorics data structures dp dsu math *3400	0 / 0	10
	274	P1845C Strong Password binary search dp greedy strings *1400	0 / 0	4
	273	P1845D Rating System binary search brute force data structures dp dsu greedy math two pointers *1800	0 / 0	6
	272	P1845E Boxes and Balls dp implementation math *2500	0 / 0	9
	271	P1845F Swimmers in the Pool dp fft math number theory *2800	0 / 0	10
	268	P1846C Rudolf and the Another Competition constructive algorithms data structures dp greedy sortings *1200	0 / 0	4
	263	P1846G Rudolf and CodeVid-23 bitmasks dp graphs greedy shortest paths *1900	0 / 0	6
	260	P1847C Vampiric Powers, anyone? bitmasks brute force dp greedy *1400	0 / 0	4
	251	P1848F Vika and Wiki binary search bitmasks combinatorics divide and conquer dp math *2400	0 / 0	9
	246	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers *2300	0 / 0	8
	232	P1851E Nastya and Potions dfs and similar dp graphs sortings *1500	0 / 0	5
	227	P1852C Ina of the Mountain data structures dp greedy math *2400	0 / 0	9
	226	P1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	10
	224	P1852F Panda Meetups data structures dp flows *3500	0 / 0	10
	219	P1854B Earn or Unlock bitmasks brute force dp *2200	0 / 0	8
	218	P1854C Expected Destruction combinatorics dp math probabilities *2500	0 / 0	9
	216	P1854E Game Bundles brute force constructive algorithms dp greedy math *3000	0 / 0	10
	215	P1854F Mark and Spaceship brute force dp *3500	0 / 0	10
	210	P1856C To Become Max binary search brute force data structures dp *1600	0 / 0	5
	208	P1856E1 PermuTree (easy version) dfs and similar dp trees *1800	0 / 0	6
	207	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft greedy implementation math trees *2700	0 / 0	10
	198	P1858B The Walkway brute force dp greedy math number theory *1500	0 / 0	5
	196	P1858D Trees and Segments brute force data structures dp greedy two pointers *2200	0 / 0	8
	191	P1859C Another Permutation Problem brute force dp greedy math *1200	0 / 0	4
	190	P1859D Andrey and Escape from Capygrad binary search data structures dp dsu greedy sortings *1800	0 / 0	6
	189	P1859E Maximum Monogonosity brute force dp math *2500	0 / 0	9
	185	P1860C Game on Permutation data structures dp games greedy *1400	0 / 0	4
	184	P1860D Balanced String dp *2200	0 / 0	8
	180	P1861B Two Binary Strings constructive algorithms dp greedy *1000	0 / 0	3
	178	P1861D Sorting By Multiplication dp greedy *1800	0 / 0	6
	177	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	175	P1862A Gift Carpet dp greedy implementation strings *800	0 / 0	3
	170	P1862F Magic Will Save the World binary search bitmasks brute force dp *1800	0 / 0	6
	164	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	163	P1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	10
	162	P1863G Swaps combinatorics dp graphs math *2800	0 / 0	10
	161	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	160	P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	156	P1864D Matrix Cascade brute force constructive algorithms data structures dp greedy math *1700	0 / 0	5
	152	P1864H Asterism Stream dp math matrices *3200	0 / 0	10
	148	P1866C Completely Searching for Inversions dfs and similar dp graphs *1900	0 / 0	6
	147	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	146	P1866E Elevators of Tamem dp *2700	0 / 0	10
	144	P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	142	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	141	P1866J Jackets and Packets dp *2800	0 / 0	10
	140	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	138	P1866M Mighty Rock Tower brute force combinatorics dp math probabilities *2400	0 / 0	9
	128	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp greedy implementation math *2100	0 / 0	7
	127	P1868C Travel Plan combinatorics dp implementation math trees *2400	0 / 0	9
	125	P1868E Min-Sum-Max constructive algorithms dp greedy *3500	0 / 0	10
	119	P1870C Colorful Table binary search data structures dp implementation math two pointers *1300	0 / 0	4
	117	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	109	P1872E Data Structures Fan binary search bitmasks data structures dp *1500	0 / 0	5
	97	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths *2400	0 / 0	9
	96	P1874C Jellyfish and EVA dp graphs greedy math probabilities *2300	0 / 0	8
	95	P1874D Jellyfish and Miku divide and conquer dp math probabilities *2800	0 / 0	10
	94	P1874E Jellyfish and Hack dp math *3000	0 / 0	10
	93	P1874F Jellyfish and OEIS dp *3500	0 / 0	10
	92	P1874G Jellyfish and Inscryption dp *3500	0 / 0	10
	89	P1875D Jellyfish and Mex dp *1600	0 / 0	5
	84	P1876E Ball-Stackable constructive algorithms data structures dp trees *3300	0 / 0	10
	70	P1879C Make it Alternating combinatorics dp greedy *1300	0 / 0	4
	69	P1879D Sum of XOR Functions bitmasks combinatorics divide and conquer dp math *1700	0 / 0	5
	62	P1881E Block Sequence dp *1500	0 / 0	5
	61	P1881F Minimum Maximum Distance dfs and similar dp graphs shortest paths trees *1700	0 / 0	5
	56	P1882D Tree XOR bitmasks dfs and similar dp greedy trees *1900	0 / 0	6
	51	P1883C Raspberries dp math *1000	0 / 0	3
	43	P1884C Medium Design brute force data structures dp greedy sortings *1700	0 / 0	5

Pick a problem randomly based on the current filter.