Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2035	P1533F Binary String Partition *special problem binary search greedy	0 / 0	(None)
	2029	P1534B Histogram Ugliness greedy implementation math *1100	0 / 0	3
	2026	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	8
	2025	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	9
	2024	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	10
	2020	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3
	2019	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2017	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2012	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	2009	P1537A Arithmetic Array greedy math *800	0 / 0	3
	2008	P1537B Bad Boy constructive algorithms greedy math *900	0 / 0	3
	2007	P1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	4
	2005	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2004	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2003	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2002	P1538A Stone Game brute force dp greedy *800	0 / 0	3
	2001	P1538B Friends and Candies greedy math *800	0 / 0	3
	1996	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	1995	P1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	3
	1993	P1539C Stable Groups greedy sortings *1200	0 / 0	4
	1992	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	1991	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	1990	P1539F Strange Array data structures greedy sortings *2600	0 / 0	10
	1989	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	1983	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	3
	1975	P1543A Exciting Bets greedy math number theory *900	0 / 0	3
	1974	P1543B Customising the Track combinatorics greedy math *900	0 / 0	3
	1970	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	1962	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	3
	1959	P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	3
	1958	P1547C Pair Programming greedy two pointers *1100	0 / 0	3
	1957	P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	4
	1953	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	4
	1948	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	10
	1946	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	3
	1945	P1550A Find The Array greedy math *800	0 / 0	3
	1944	P1550B Maximum Cost Deletion greedy math *1000	0 / 0	3
	1943	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	5
	1939	P1551A Polycarp and Coins greedy math *800	0 / 0	3
	1938	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	3
	1937	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	4
	1936	P1551C Interesting Story greedy sortings strings *1500	0 / 0	5
	1930	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	5
	1929	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	6
	1927	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1920	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	4
	1919	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	5
	1913	P1554A Cherry greedy *800	0 / 0	3
	1912	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	5
	1911	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	6
	1910	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	6
	1898	P1556E Equilibrium data structures dp greedy *2200	0 / 0	8
	1895	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	10
	1893	P1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	3
	1891	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	8
	1887	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	7
	1885	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	10
	1882	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	3
	1880	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	4
	1879	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	9
	1874	P1560D Make a Power of Two greedy math strings *1300	0 / 0	4
	1872	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	6
	1871	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	7
	1869	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	4
	1867	P1562A The Miracle and the Sleeper greedy math *800	0 / 0	3
	1862	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	9
	1860	P1566A Median Maximization binary search greedy math *800	0 / 0	3
	1859	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	3
	1858	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	3
	1857	P1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	3
	1856	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	5
	1855	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	7
	1854	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	10
	1853	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	10
	1850	P1567B MEXor Mixup bitmasks greedy *1000	0 / 0	3
	1848	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	7
	1835	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	5
	1828	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	9
	1827	P1572C Paint dp greedy *2700	0 / 0	10
	1826	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	10
	1823	P1573A Countdown greedy *800	0 / 0	3
	1822	P1573B Swaps greedy math sortings *1400	0 / 0	4
	1820	P1574B Combinatorics Homework combinatorics greedy math *1100	0 / 0	3
	1819	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	4
	1818	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	7
	1790	P1578L Labyrinth binary search dsu greedy *2400	0 / 0	9
	1786	P1579C Ticks greedy implementation *1500	0 / 0	5
	1785	P1579D Productive Meeting constructive algorithms graphs greedy *1400	0 / 0	4
	1784	P1579E1 Permutation Minimization by Deque constructive algorithms greedy math *1000	0 / 0	3
	1783	P1579E2 Array Optimization by Deque data structures greedy *1700	0 / 0	5
	1780	P1580A Portal brute force data structures dp greedy implementation *1700	0 / 0	5
	1777	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	10
	1773	P1581B Diameter of Graph constructive algorithms graphs greedy math *1200	0 / 0	4
	1770	P1582C Grandma Capa Knits a Scarf brute force data structures greedy strings two pointers *1200	0 / 0	4
	1768	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	7
	1767	P1582F1 Korney Korneevich and XOR (easy version) bitmasks dp greedy *1800	0 / 0	6
	1766	P1582F2 Korney Korneevich and XOR (hard version) binary search brute force dp greedy two pointers *2400	0 / 0	9
	1761	P1583D Omkar and the Meaning of Life constructive algorithms greedy interactive *1800	0 / 0	6
	1760	P1583E Moment of Bloom constructive algorithms dfs and similar graph matchings graphs greedy trees *2200	0 / 0	8
	1755	P1584B Coloring Rectangles greedy math *1000	0 / 0	3

Pick a problem randomly based on the current filter.