Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1053	P1713A Traveling Salesman Problem geometry greedy implementation *800	0 / 0	3
	1050	P1713D Tournament Countdown constructive algorithms greedy interactive number theory probabilities *1800	0 / 0	6
	1049	P1713E Cross Swapping 2-sat data structures dsu greedy matrices *2400	0 / 0	9
	1046	P1714B Remove Prefix data structures greedy implementation *800	0 / 0	3
	1045	P1714C Minimum Varied Number greedy *800	0 / 0	3
	1044	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	1040	P1715A Crossmarket constructive algorithms greedy math *800	0 / 0	3
	1039	P1715B Beautiful Array constructive algorithms greedy math *1000	0 / 0	3
	1037	P1715D 2+ doors 2-sat bitmasks graphs greedy *1900	0 / 0	6
	1036	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	1034	P1716A 2-3 Moves greedy math *800	0 / 0	3
	1032	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	1026	P1717C Madoka and Formal Statement greedy *1300	0 / 0	4
	1025	P1717D Madoka and The Corruption Scheme combinatorics constructive algorithms greedy math *1900	0 / 0	6
	1022	P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	6
	1021	P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	6
	1020	P1718B Fibonacci Strings greedy implementation math number theory *2000	0 / 0	7
	1019	P1718C Tonya and Burenka-179 data structures greedy math number theory *2400	0 / 0	9
	1018	P1718D Permutation for Burenka data structures graph matchings greedy math trees *3300	0 / 0	10
	1011	P1720B Interesting Sum brute force data structures greedy math sortings *800	0 / 0	3
	1010	P1720C Corners greedy implementation *1200	0 / 0	4
	1007	P1720E Misha and Paintings constructive algorithms data structures greedy implementation math *2700	0 / 0	10
	1006	P1721A Image greedy implementation *800	0 / 0	3
	1004	P1721C Min-Max Array Transformation binary search greedy two pointers *1400	0 / 0	4
	1003	P1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	6
	997	P1722D Line greedy sortings *1100	0 / 0	3
	994	P1722G Even-Odd XOR bitmasks constructive algorithms greedy *1500	0 / 0	5
	992	P1725B Basketball Together binary search greedy sortings *1000	0 / 0	3
	980	P1726A Mainak and Array greedy math *900	0 / 0	3
	978	P1726C Jatayu's Balanced Bracket Sequence data structures dsu graphs greedy *1300	0 / 0	4
	975	P1726F Late For Work (submissions are not allowed) data structures greedy schedules shortest paths *2900	0 / 0	10
	974	P1726G A Certain Magical Party combinatorics data structures greedy sortings *3300	0 / 0	10
	972	P1728A Colored Balls: Revisited brute force greedy implementation sortings *800	0 / 0	3
	971	P1728B Best Permutation constructive algorithms greedy *800	0 / 0	3
	970	P1728C Digital Logarithm data structures greedy sortings *1400	0 / 0	4
	968	P1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	8
	967	P1728F Fishermen flows graph matchings greedy *3100	0 / 0	10
	964	P1729B Decode String greedy strings *800	0 / 0	3
	962	P1729D Friends and the Restaurant greedy sortings two pointers *1200	0 / 0	4
	958	P1730A Planets data structures greedy sortings *800	0 / 0	3
	957	P1730B Meeting on the Line binary search geometry greedy implementation math ternary search *1600	0 / 0	5
	956	P1730C Minimum Notation data structures greedy math sortings *1200	0 / 0	4
	952	P1731A Joey Takes Money greedy math *800	0 / 0	3
	951	P1731B Kill Demodogs greedy math *1100	0 / 0	3
	948	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	945	P1732B Ugu brute force dp greedy implementation *900	0 / 0	3
	944	P1732C1 Sheikh (Easy version) binary search bitmasks greedy two pointers *1800	0 / 0	6
	943	P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	939	P1733A Consecutive Sum greedy sortings *800	0 / 0	3
	936	P1733D1 Zero-One (Easy Version) constructive algorithms greedy math *1400	0 / 0	4
	935	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	933	P1734A Select Three Sticks brute force greedy sortings *800	0 / 0	3
	931	P1734C Removing Smallest Multiples greedy math *1200	0 / 0	4
	930	P1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	6
	927	P1735A Working Week constructive algorithms greedy math *800	0 / 0	3
	926	P1735B Tea with Tangerines greedy math *900	0 / 0	3
	925	P1735C Phase Shift dfs and similar dsu graphs greedy implementation strings *1400	0 / 0	4
	923	P1735E House Planning constructive algorithms data structures graph matchings greedy *2400	0 / 0	9
	921	P1736A Make A Equal to B brute force greedy sortings *800	0 / 0	3
	917	P1736D Equal Binary Subsequences constructive algorithms geometry greedy implementation strings *2200	0 / 0	8
	916	P1736E Swap and Take dp greedy *2600	0 / 0	10
	915	P1737A Ela Sorting Books greedy implementation strings *900	0 / 0	3
	912	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	908	P1738A Glory Addicts greedy implementation sortings *800	0 / 0	3
	907	P1738B Prefix Sum Addicts constructive algorithms greedy math sortings *1200	0 / 0	4
	906	P1738C Even Number Addicts dp games greedy math *1500	0 / 0	5
	903	P1738F Connectivity Addicts constructive algorithms dsu graphs greedy interactive shortest paths trees *2400	0 / 0	9
	902	P1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	10
	899	P1739B Array Recovery constructive algorithms greedy math *1100	0 / 0	3
	897	P1739D Reset K Edges binary search data structures dfs and similar graphs greedy trees *1900	0 / 0	6
	893	P1740B Jumbo Extra Cheese 2 geometry greedy sortings *800	0 / 0	3
	892	P1740C Bricks and Bags constructive algorithms games greedy sortings *1400	0 / 0	4
	890	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	883	P1741C Minimize the Thickness brute force greedy math two pointers *1100	0 / 0	3
	877	P1742B Increasing greedy implementation sortings *800	0 / 0	3
	875	P1742D Coprime brute force greedy number theory *1100	0 / 0	3
	874	P1742E Scuza binary search greedy math *1200	0 / 0	4
	873	P1742F Smaller constructive algorithms greedy strings *1500	0 / 0	5
	872	P1742G Orray bitmasks brute force greedy math sortings *1500	0 / 0	5
	870	P1743B Permutation Value constructive algorithms greedy *800	0 / 0	3
	869	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	868	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	864	P1744A Number Replacement greedy implementation *800	0 / 0	3
	861	P1744D Divisibility by 2^n greedy math sortings *1200	0 / 0	4
	857	P1746A Maxmina constructive algorithms greedy *800	0 / 0	3
	856	P1746B Rebellion constructive algorithms greedy two pointers *800	0 / 0	3
	855	P1746C Permutation Operations constructive algorithms greedy implementation math *1300	0 / 0	4
	854	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	849	P1747A Two Groups constructive algorithms greedy *800	0 / 0	3
	842	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	838	P1749A Cowardly Rooks greedy implementation *800	0 / 0	3
	837	P1749B Death's Blessing greedy *900	0 / 0	3
	836	P1749C Number Game binary search data structures games greedy implementation *1400	0 / 0	4
	831	P1750B Maximum Substring brute force greedy implementation *800	0 / 0	3
	828	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	824	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	823	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	5
	819	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	817	P1754A Technical Support greedy *800	0 / 0	3
	816	P1754B Kevin and Permutation constructive algorithms greedy math *800	0 / 0	3

Pick a problem randomly based on the current filter.