Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	44	P1884B Haunted House binary search greedy math two pointers *1100	0 / 0	3
	43	P1884C Medium Design brute force data structures dp greedy sortings *1700	0 / 0	5
	41	P1884E Hard Design greedy implementation math *2800	0 / 0	10
	36	P1886E I Wanna be the Team Leader bitmasks constructive algorithms dp greedy math sortings two pointers *2400	0 / 0	9
	35	P1886F Diamond Theft data structures greedy *3300	0 / 0	10
	33	P1887C Minimum Array binary search brute force constructive algorithms data structures greedy hashing two pointers *2400	0 / 0	9
	29	P1889A Qingshan Loves Strings 2 constructive algorithms greedy implementation *1300	0 / 0	4
	28	P1889B Doremy's Connecting Plan constructive algorithms greedy math sortings *1700	0 / 0	5
	27	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings *2000	0 / 0	7
	23	P1889F Doremy's Average Tree data structures dp greedy trees *3500	0 / 0	10
	18	P1891C Smilo and Monsters binary search constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	16	P1891E Brukhovich and Exams brute force greedy implementation math sortings *2500	0 / 0	9
	13	P1893B Neutral Tonality constructive algorithms greedy sortings two pointers *1700	0 / 0	5
	12	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	11	P1893D Colorful Constructive constructive algorithms data structures greedy math *2600	0 / 0	10
	6	P1895B Points and Minimum Distance greedy math sortings *800	0 / 0	3
	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
	1	P1895G Two Characters, Two Colors binary search data structures dp flows greedy *3100	0 / 0	10
	5147	P1896B AB Flipping greedy strings two pointers	0 / 0	(None)
	5146	P1896C Matching Arrays binary search constructive algorithms greedy sortings	0 / 0	(None)
	5132	P1898B Milena and Admirer greedy math	0 / 0	(None)
	5130	P1898D Absolute Beauty greedy math	0 / 0	(None)
	5129	P1898E Sofia and Strings data structures greedy sortings string suffix structures strings two pointers	0 / 0	(None)
	5069	P1899C Yarik and Array dp greedy two pointers	0 / 0	(None)
	5067	P1899E Queue Sort greedy implementation sortings	0 / 0	(None)
	5349	P1900A Cover in Water constructive algorithms greedy implementation strings *800	0 / 0	3
	5138	P1901B Chip and Ribbon greedy math *1100	0 / 0	3
	5137	P1901C Add, Divide and Floor constructive algorithms greedy math *1400	0 / 0	4
	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
	6624	P1902B Getting Points binary search brute force greedy *1100	0 / 0	3
	6623	P1902C Insert and Equalize brute force constructive algorithms greedy math number theory *1300	0 / 0	4
	5343	P1903A Halloumi Boxes brute force greedy sortings *800	0 / 0	3
	5342	P1903B StORage room bitmasks brute force constructive algorithms greedy *1200	0 / 0	4
	5341	P1903C Theofanis' Nightmare constructive algorithms dp greedy *1400	0 / 0	4
	5340	P1903D1 Maximum And Queries (easy version) binary search bitmasks brute force greedy *1700	0 / 0	5
	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
	6707	P1904D1 Set To Max (Easy Version) brute force constructive algorithms greedy *1600	0 / 0	5
	6706	P1904D2 Set To Max (Hard Version) constructive algorithms data structures divide and conquer greedy implementation sortings *1800	0 / 0	6
	6702	P1905B Begginer's Zelda greedy trees *1100	0 / 0	3
	6701	P1905C Largest Subsequence greedy strings *1400	0 / 0	4
	6607	P1906M Triangle Construction greedy math *1700	0 / 0	5
	6604	P1907C Removal of Unattractive Pairs constructive algorithms greedy math strings *1100	0 / 0	3
	6601	P1907F Shift and Reverse greedy sortings *1800	0 / 0	6
	6600	P1907G Lights brute force constructive algorithms dfs and similar graphs greedy implementation *2200	0 / 0	8
	6695	P1909C Heavy Intervals constructive algorithms data structures dsu greedy math sortings *1400	0 / 0	4
	6694	P1909D Split Plus K greedy math number theory *1900	0 / 0	6
	6686	P1910B Security Guard special problem greedy 1700	0 / 0	5
	6684	P1910D Remove and Add special problem greedy 1800	0 / 0	6
	6682	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	6681	P1910G Pool Records special problem greedy 2700	0 / 0	10
	6663	P1913C Game with Multiset binary search bitmasks brute force greedy *1300	0 / 0	4
	6657	P1914C Quests greedy math *1100	0 / 0	3
	6656	P1914D Three Activities brute force dp greedy implementation sortings *1200	0 / 0	4
	6655	P1914E1 Game with Marbles (Easy Version) brute force games greedy sortings *1400	0 / 0	4
	6654	P1914E2 Game with Marbles (Hard Version) games greedy sortings *1400	0 / 0	4
	6653	P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	6647	P1915D Unnatural Language Processing greedy implementation strings *900	0 / 0	3
	6646	P1915E Romantic Glasses data structures greedy math *1300	0 / 0	4
	6644	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	6641	P1916C Training Before the Olympiad constructive algorithms games greedy implementation math *1200	0 / 0	4
	6639	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	6638	P1916F Group Division constructive algorithms dfs and similar graphs greedy *2900	0 / 0	10
	6632	P1917C Watering an Array brute force greedy implementation math *1600	0 / 0	5
	8207	P1918A Brick Wall constructive algorithms greedy implementation math *800	0 / 0	3
	8206	P1918B Minimize Inversions constructive algorithms data structures greedy implementation sortings *900	0 / 0	3
	8205	P1918C XOR-distance bitmasks dp greedy implementation math *1400	0 / 0	4
	8202	P1918F Caterpillar on a Tree data structures dfs and similar dp graphs greedy implementation sortings trees *2500	0 / 0	9
	7325	P1919A Wallet Exchange greedy math *800	0 / 0	3
	7324	P1919B Plus-Minus Split greedy *800	0 / 0	3
	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
	7319	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	8200	P1920A Satisfying Constraints brute force greedy math *800	0 / 0	3
	8199	P1920B Summation Game games greedy math sortings *1100	0 / 0	3
	8193	P1921A Square greedy math *800	0 / 0	3
	8192	P1921B Arranging Cats greedy implementation *800	0 / 0	3
	8191	P1921C Sending Messages greedy math *900	0 / 0	3
	8190	P1921D Very Different Array data structures greedy sortings two pointers *1100	0 / 0	3
	8189	P1921E Eat the Chip brute force games greedy math *1600	0 / 0	5
	8184	P1922C Closest Cities greedy implementation math *1300	0 / 0	4
	8182	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6
	8930	P1923A Moving Chips greedy implementation	0 / 0	(None)
	8929	P1923B Monsters Attack! dp greedy implementation	0 / 0	(None)
	8928	P1923C Find B constructive algorithms greedy	0 / 0	(None)
	8927	P1923D Slimes binary search constructive algorithms data structures greedy two pointers	0 / 0	(None)
	8925	P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings	0 / 0	(None)
	8180	P1924A Did We Get Everything Covered? constructive algorithms dp greedy shortest paths strings *1500	0 / 0	5
	8174	P1925A We Got Everything Covered! constructive algorithms greedy strings *800	0 / 0	3
	8173	P1925B A Balanced Problemset? brute force greedy math number theory *1200	0 / 0	4
	8921	P1926D Vlad and Division bitmasks greedy	0 / 0	(None)
	8918	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	8917	P1927A Make it White greedy strings *800	0 / 0	3
	8916	P1927B Following the String constructive algorithms greedy strings *900	0 / 0	3
	8915	P1927C Choose the Different Ones! brute force greedy math *1000	0 / 0	3
	8914	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	8912	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	8911	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8

Pick a problem randomly based on the current filter.