Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2319	P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2318	P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2314	P1480A Yet Another String Game games greedy strings *800	0 / 0	3
	2313	P1480B The Great Hero greedy implementation sortings *900	0 / 0	3
	2312	P1481A Space Navigation greedy strings *800	0 / 0	3
	2311	P1481B New Colony brute force greedy implementation *1100	0 / 0	3
	2310	P1481C Fence Painting brute force constructive algorithms greedy *1600	0 / 0	5
	2309	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2308	P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2307	P1481F AB Tree dp greedy trees *3100	0 / 0	10
	2304	P1482C Basic Diplomacy brute force constructive algorithms greedy implementation *1600	0 / 0	5
	2298	P1485A Add and Divide brute force greedy math number theory *1000	0 / 0	3
	2294	P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2292	P1486A Shifting Stacks greedy implementation *900	0 / 0	3
	2283	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	5
	2281	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2280	P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2277	P1488B RBS Deletion special problem greedy 1800	0 / 0	6
	2275	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	2272	P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	9
	2268	P1490A Dense Array greedy math *800	0 / 0	3
	2264	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2263	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2261	P1491A K-th Largest Value brute force greedy implementation *800	0 / 0	3
	2259	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2258	P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2251	P1492B Card Deck data structures greedy math *1100	0 / 0	3
	2250	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2249	P1492D Genius's Gambit bitmasks constructive algorithms greedy math *1900	0 / 0	6
	2248	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	9
	2247	P1493A Anti-knapsack constructive algorithms greedy *800	0 / 0	3
	2245	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2243	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	10
	2240	P1494B Berland Crossword bitmasks brute force greedy implementation *1400	0 / 0	4
	2239	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	2238	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2235	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	4
	2234	P1495B Let's Go Hiking games greedy *1900	0 / 0	6
	2231	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	10
	2229	P1496A Split it! brute force constructive algorithms greedy strings *900	0 / 0	3
	2227	P1497A Meximization brute force data structures greedy sortings *800	0 / 0	3
	2226	P1497B M-arrays constructive algorithms greedy math *1200	0 / 0	4
	2222	P1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	5
	2221	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	9
	2219	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2216	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	2213	P1499B Binary Removals brute force dp greedy implementation *1000	0 / 0	3
	2212	P1499C Minimum Grid Path brute force data structures greedy math *1500	0 / 0	5
	2205	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	10
	2199	P1503A Balance the Bits constructive algorithms greedy *1600	0 / 0	5
	2197	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2196	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	10
	2192	P1504B Flip the Bits constructive algorithms greedy implementation math *1200	0 / 0	4
	2187	P1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	6
	2181	P1506B Partial Replacement greedy implementation *1100	0 / 0	3
	2179	P1506D Epic Transformation constructive algorithms data structures greedy *1400	0 / 0	4
	2176	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2175	P1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	6
	2173	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2168	P1509B TMT Document greedy *1100	0 / 0	3
	2167	P1509C The Sports Festival dp greedy *1800	0 / 0	6
	2158	P1510I Is It Rated? greedy interactive math probabilities *2700	0 / 0	10
	2155	P1511A Review Site greedy *800	0 / 0	3
	2152	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2151	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2145	P1512D Corrupted Array constructive algorithms data structures greedy *1200	0 / 0	4
	2144	P1512E Permutation by Sum brute force greedy math *1600	0 / 0	5
	2143	P1512F Education brute force dp greedy implementation *1900	0 / 0	6
	2138	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	2133	P1514C Product 1 Modulo N greedy number theory *1600	0 / 0	5
	2132	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2130	P1515A Phoenix and Gold constructive algorithms greedy math *800	0 / 0	3
	2128	P1515C Phoenix and Towers constructive algorithms data structures greedy *1400	0 / 0	4
	2127	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	2125	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	10
	2121	P1516A Tit for Tat greedy *800	0 / 0	3
	2120	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2116	P1517A Sum of 2050 greedy math *800	0 / 0	3
	2115	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	2114	P1517C Fillomino 2 constructive algorithms dfs and similar greedy implementation *1400	0 / 0	4
	2106	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	2098	P1520E Arranging The Sheep greedy math *1400	0 / 0	4
	2095	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	2091	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	9
	2090	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2087	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	5
	2080	P1525B Permutation Sort constructive algorithms greedy *900	0 / 0	3
	2079	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2078	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2073	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	5
	2072	P1526C2 Potions (Hard Version) data structures greedy *1600	0 / 0	5
	2062	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	2060	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	8
	2056	P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	3
	2055	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	3
	2054	P1530A Binary Decimal greedy math *800	0 / 0	3
	2052	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2051	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2050	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2036	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)

Pick a problem randomly based on the current filter.