Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1754	P1584C Two Arrays greedy math sortings *900	0 / 0	3
	1752	P1584E Game with Stones binary search data structures games greedy *2300	0 / 0	8
	1751	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	10
	1748	P1585B Array Eversion greedy *900	0 / 0	3
	1747	P1585C Minimize Distance greedy *1300	0 / 0	4
	1740	P1592A Gamer Hemose binary search greedy math sortings *800	0 / 0	3
	1736	P1592E Bored Bakry bitmasks greedy math two pointers *2400	0 / 0	9
	1735	P1592F1 Alice and Recoloring 1 constructive algorithms greedy *2600	0 / 0	10
	1734	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1732	P1593B Make it Divisible by 25 dfs and similar dp greedy math math *900	0 / 0	3
	1731	P1593C Save More Mice binary search greedy greedy *1000	0 / 0	3
	1728	P1593E Gardener and Tree brute force data structures dfs and similar greedy implementation trees *1600	0 / 0	5
	1726	P1593G Changing Brackets constructive algorithms data structures dp greedy *2200	0 / 0	8
	1723	P1594C Make Them Equal brute force greedy math strings *1200	0 / 0	4
	1711	P1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	10
	1702	P1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	10
	1701	P1600E Array Game games greedy two pointers *1900	0 / 0	6
	1698	P1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	4
	1696	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1695	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	10
	1694	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	10
	1688	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	8
	1684	P1604A Era greedy *800	0 / 0	3
	1681	P1605B Reverse Sort greedy sortings *1000	0 / 0	3
	1680	P1605C Dominant Character brute force greedy implementation strings *1400	0 / 0	4
	1679	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	7
	1678	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	9
	1675	P1606B Update Files greedy implementation math *1100	0 / 0	3
	1674	P1606C Banknotes greedy number theory *1400	0 / 0	4
	1667	P1607D Blue-Red Permutation greedy math sortings *1300	0 / 0	4
	1664	P1607G Banquet Preparations 1 greedy *2200	0 / 0	8
	1663	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	8
	1661	P1608B Build the Permutation constructive algorithms greedy *1200	0 / 0	4
	1660	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	5
	1655	P1609A Divide and Multiply greedy implementation math number theory *900	0 / 0	3
	1652	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	5
	1649	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	10
	1646	P1610B Kalindrome Array greedy two pointers *1100	0 / 0	3
	1645	P1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	5
	1643	P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	8
	1641	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	10
	1640	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	10
	1634	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	5
	1633	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	6
	1631	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	9
	1629	P1612B Special Permutation constructive algorithms greedy *900	0 / 0	3
	1626	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	7
	1625	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1624	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	9
	1622	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	3
	1617	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	3
	1611	P1615A Closing The Gap greedy math *800	0 / 0	3
	1610	P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	4
	1609	P1615C Menorah brute force graphs greedy math *1600	0 / 0	5
	1607	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	9
	1602	P1616B Mirror in the String greedy strings *1100	0 / 0	3
	1600	P1616D Keep the Average High dp greedy math *2000	0 / 0	7
	1599	P1616E Lexicographically Small Enough brute force data structures greedy strings *2200	0 / 0	8
	1595	P1617A Forbidden Subsequence constructive algorithms greedy sortings strings *800	0 / 0	3
	1593	P1617C Paprika and Permutation binary search greedy math sortings *1300	0 / 0	4
	1586	P1618D Array and Operations dp greedy math *1300	0 / 0	4
	1583	P1618G Trader Problem data structures dsu greedy sortings *2200	0 / 0	8
	1579	P1619D New Year's Problem binary search greedy sortings *1800	0 / 0	6
	1578	P1619E MEX and Increments constructive algorithms data structures dp greedy implementation math sortings *1700	0 / 0	5
	1577	P1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	7
	1576	P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	7
	1573	P1620B Triangles on a Rectangle geometry greedy math *1000	0 / 0	3
	1572	P1620C BA-String brute force dp greedy implementation math *1800	0 / 0	6
	1571	P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	7
	1569	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	1566	P1621B Integers Shop data structures greedy implementation *1500	0 / 0	5
	1564	P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	7
	1563	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1562	P1621F Strange Instructions data structures greedy implementation *2700	0 / 0	10
	1557	P1622B Berland Music data structures greedy math sortings *1000	0 / 0	3
	1556	P1622C Set or Decrease binary search brute force greedy sortings *1600	0 / 0	5
	1554	P1622E Math Test bitmasks brute force greedy *2200	0 / 0	8
	1550	P1623C Balanced Stone Heaps binary search greedy *1600	0 / 0	5
	1548	P1623E Middle Duplication data structures dfs and similar greedy strings trees *2500	0 / 0	9
	1545	P1624C Division by Two and Permutation constructive algorithms flows graph matchings greedy math *1100	0 / 0	3
	1544	P1624D Palindromes Coloring binary search greedy sortings strings *1400	0 / 0	4
	1541	P1624G MinOr Tree bitmasks dfs and similar dsu graphs greedy *1900	0 / 0	6
	1540	P1625A Ancient Civilization bitmasks greedy math *800	0 / 0	3
	1539	P1625B Elementary Particles brute force greedy sortings *1100	0 / 0	3
	1533	P1626B Minor Reduction greedy strings *1100	0 / 0	3
	1532	P1626C Monsters And Spells binary search data structures dp greedy implementation math two pointers *1700	0 / 0	5
	1531	P1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	7
	1530	P1626E Black and White Tree dfs and similar greedy trees *2400	0 / 0	9
	1527	P1627B Not Sitting games greedy sortings *1300	0 / 0	4
	1523	P1627F Not Splitting geometry graphs greedy implementation shortest paths *2700	0 / 0	10
	1522	P1628A Meximum Array binary search constructive algorithms greedy implementation math two pointers *1400	0 / 0	4
	1521	P1628B Peculiar Movie Preferences greedy strings *1700	0 / 0	5
	1520	P1628C Grid Xor constructive algorithms greedy implementation interactive math *2300	0 / 0	8
	1515	P1629A Download More RAM brute force greedy sortings *800	0 / 0	3
	1514	P1629B GCD Arrays greedy math number theory *800	0 / 0	3
	1512	P1630B Range and Partition binary search constructive algorithms data structures greedy two pointers *1800	0 / 0	6
	1511	P1630C Paint the Middle dp greedy sortings two pointers *2200	0 / 0	8
	1510	P1630D Flipping Range constructive algorithms dp greedy number theory *2400	0 / 0	9
	1507	P1631A Min Max Swap greedy *800	0 / 0	3
	1506	P1631B Fun with Even Subarrays dp greedy *1100	0 / 0	3

Pick a problem randomly based on the current filter.