Problem Set - dp - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	42	P1884D Counting Rhyme dp math number theory *2100	0 / 0	7
	36	P1886E I Wanna be the Team Leader bitmasks constructive algorithms dp greedy math sortings two pointers *2400	0 / 0	9
	27	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings *2000	0 / 0	7
	26	P1889C2 Doremy's Drying Plan (Hard Version) data structures dp *2600	0 / 0	10
	23	P1889F Doremy's Average Tree data structures dp greedy trees *3500	0 / 0	10
	10	P1893E Cacti Symphony combinatorics dfs and similar dp graphs *3500	0 / 0	10
	5	P1895C Torn Lucky Ticket brute force dp hashing implementation math *1400	0 / 0	4
	3	P1895E Infinite Card Game binary search brute force data structures dfs and similar dp dsu games graphs greedy sortings two pointers *2300	0 / 0	8
	2	P1895F Fancy Arrays combinatorics dp math matrices *2600	0 / 0	10
	1	P1895G Two Characters, Two Colors binary search data structures dp flows greedy *3100	0 / 0	10
	5141	P1896H1 Cyclic Hamming (Easy Version) divide and conquer dp fft math number theory	0 / 0	(None)
	5140	P1896H2 Cyclic Hamming (Hard Version) dp fft math number theory	0 / 0	(None)
	5069	P1899C Yarik and Array dp greedy two pointers	0 / 0	(None)
	5348	P1900B Laura and Operations dp math *900	0 / 0	3
	5347	P1900C Anji's Binary Tree dfs and similar dp shortest paths trees *1300	0 / 0	4
	5346	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	5345	P1900E Transitive Graph dfs and similar dp dsu graphs implementation *2100	0 / 0	7
	5136	P1901D Yet Another Monster Fight binary search dp greedy implementation math *1700	0 / 0	5
	5135	P1901E Compressed Tree dfs and similar dp graphs greedy sortings trees *2200	0 / 0	8
	6622	P1902D Robot Queries binary search data structures dp implementation *1900	0 / 0	6
	5341	P1903C Theofanis' Nightmare constructive algorithms dp greedy *1400	0 / 0	4
	5339	P1903D2 Maximum And Queries (hard version) binary search bitmasks divide and conquer dp greedy *2500	0 / 0	9
	5338	P1903E Geo Game constructive algorithms dp games greedy interactive math *2000	0 / 0	7
	6709	P1904B Collecting Game binary search dp greedy sortings two pointers *1100	0 / 0	3
	6699	P1905E One-X combinatorics dfs and similar dp math trees *2400	0 / 0	9
	6615	P1906E Merge Not Sort constructive algorithms dp *1900	0 / 0	6
	6612	P1906H Twin Friends combinatorics dp *2200	0 / 0	8
	6610	P1906J Count BFS Graph combinatorics dp *2100	0 / 0	7
	6692	P1909F1 Small Permutation Problem (Easy Version) brute force combinatorics dp math *2200	0 / 0	8
	6691	P1909F2 Small Permutation Problem (Hard Version) combinatorics dp math *2500	0 / 0	9
	6688	P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	6683	P1910E Maximum Sum Subarrays special problem dp 2100	0 / 0	7
	6679	P1910I Inverse Problem special problem combinatorics dp 2700	0 / 0	10
	6667	P1912K Kim's Quest bitmasks combinatorics dp *1800	0 / 0	6
	6662	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	6656	P1914D Three Activities brute force dp greedy implementation sortings *1200	0 / 0	4
	6653	P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	6652	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	6651	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	6637	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	6636	P1916H1 Matrix Rank (Easy Version) brute force combinatorics dp math matrices *2700	0 / 0	10
	6635	P1916H2 Matrix Rank (Hard Version) combinatorics dp math matrices string suffix structures *2700	0 / 0	10
	6633	P1917B Erase First or Second Letter brute force combinatorics data structures dp strings *1100	0 / 0	3
	6631	P1917D Yet Another Inversions Problem combinatorics data structures dp implementation math number theory *2300	0 / 0	8
	6629	P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	8205	P1918C XOR-distance bitmasks dp greedy implementation math *1400	0 / 0	4
	8204	P1918D Blocking Elements binary search data structures dp implementation two pointers *1900	0 / 0	6
	8202	P1918F Caterpillar on a Tree data structures dfs and similar dp graphs greedy implementation sortings trees *2500	0 / 0	9
	7323	P1919C Grouping Increases data structures dp greedy *1400	0 / 0	4
	7322	P1919D 01 Tree constructive algorithms data structures divide and conquer dp dsu greedy implementation sortings trees *2100	0 / 0	7
	7321	P1919E Counting Prefixes combinatorics constructive algorithms dp math *2600	0 / 0	10
	7319	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	8196	P1920E Counting Binary Strings combinatorics dp math *2100	0 / 0	7
	8188	P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	8187	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	8181	P1922F Replace on Segment dp graph matchings *2500	0 / 0	9
	8929	P1923B Monsters Attack! dp greedy implementation	0 / 0	(None)
	8926	P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(None)
	8180	P1924A Did We Get Everything Covered? constructive algorithms dp greedy shortest paths strings *1500	0 / 0	5
	8177	P1924D Balanced Subsequences combinatorics dp math *2700	0 / 0	10
	8175	P1924F Anti-Proxy Attendance constructive algorithms dp interactive ternary search *3500	0 / 0	10
	8172	P1925D Good Trip combinatorics dp math probabilities *1900	0 / 0	6
	8922	P1926C Vlad and a Sum of Sum of Digits dp implementation	0 / 0	(None)
	8920	P1926E Vlad and an Odd Ordering binary search bitmasks data structures dp implementation math number theory	0 / 0	(None)
	8919	P1926F Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation	0 / 0	(None)
	8918	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	8914	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	8911	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
	8906	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	8901	P1929D Sasha and a Walk in the City combinatorics dp math trees *1900	0 / 0	6
	8900	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8895	P1930D1 Sum over all Substrings (Easy Version) brute force dp greedy strings	0 / 0	(None)
	8894	P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	0 / 0	(None)
	8893	P1930E 2..3...4... combinatorics dp math	0 / 0	(None)
	8891	P1930G Prefix Max Set Counting data structures dp trees	0 / 0	(None)
	8881	P1932A Thorns and Coins dp greedy implementation	0 / 0	(None)
	8876	P1932F Feed Cats data structures dp sortings	0 / 0	(None)
	8869	P1933F Turtle Mission: Robot and the Earthquake dfs and similar dp graphs shortest paths	0 / 0	(None)
	8866	P1934B Yet Another Coin Problem brute force dp greedy math	0 / 0	(None)
	8859	P1935C Messenger in MAC binary search brute force constructive algorithms data structures dp greedy sortings	0 / 0	(None)
	8848	P1937B Binary Path dp greedy implementation	0 / 0	(None)
	9387	P1958A 1-3-5 special problem dp 1100	0 / 0	3
	9380	P1958H Composite Spells special problem dp 2600	0 / 0	10
	9366	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9364	P1967E1 Again Counting Arrays (Easy Version) combinatorics dp fft math *3100	0 / 0	10
	9363	P1967E2 Again Counting Arrays (Hard Version) combinatorics dp math *3500	0 / 0	10
	9355	P1968G1 Division + LCP (easy version) binary search data structures dp hashing string suffix structures strings *1900	0 / 0	6
	9354	P1968G2 Division + LCP (hard version) binary search brute force data structures dp hashing math string suffix structures strings *2200	0 / 0	8
	9351	P1969C Minimizing the Sum dp implementation *1700	0 / 0	5
	9349	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	9348	P1969F Card Pairing dp greedy hashing implementation *3000	0 / 0	10
	9340	P1970C2 Game on Tree (Medium) dfs and similar dp games trees *1700	0 / 0	5
	9339	P1970C3 Game on Tree (Hard) dfs and similar dp games trees *1900	0 / 0	6
	9335	P1970E1 Trails (Easy) dp *1800	0 / 0	6
	9334	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	9333	P1970E3 Trails (Hard) dp matrices *2200	0 / 0	8
	9328	P1970G2 Min-Fund Prison (Medium) brute force dfs and similar dp graphs trees *2200	0 / 0	8
	9327	P1970G3 Min-Fund Prison (Hard) bitmasks dfs and similar dp graphs trees *2400	0 / 0	9
	9323	P1971D Binary Cut dp greedy implementation sortings strings *1100	0 / 0	3
	9316	P1973A Chess For Three brute force dp implementation math *900	0 / 0	3

Pick a problem randomly based on the current filter.