Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2553	P1430C Numbers on Whiteboard constructive algorithms data structures greedy implementation math *1000	0 / 0	3
	2552	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	5
	2551	P1430E String Reversal data structures greedy strings *1900	0 / 0	6
	2550	P1430F Realistic Gameplay dp greedy *2600	0 / 0	10
	2545	P1431D Used Markers special problem greedy 1500	0 / 0	5
	2543	P1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	7
	2542	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	2541	P1431H Rogue-like Game special problem brute force greedy two pointers 2600	0 / 0	10
	2537	P1433B Yet Another Bookshelf greedy implementation *800	0 / 0	3
	2536	P1433C Dominant Piranha constructive algorithms greedy *900	0 / 0	3
	2527	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2524	P1437A Marketing Scheme brute force constructive algorithms greedy math *800	0 / 0	3
	2523	P1437B Reverse Binary Strings constructive algorithms greedy *1200	0 / 0	4
	2522	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2521	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	5
	2516	P1438B Valerii Against Everyone constructive algorithms data structures greedy sortings *1000	0 / 0	3
	2510	P1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	6
	2508	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	2504	P1440B Sum of Medians greedy math *900	0 / 0	3
	2503	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	6
	2502	P1442B Identify the Operations combinatorics data structures dsu greedy implementation *1800	0 / 0	6
	2501	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	9
	2500	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2499	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2496	P1443B Saving the City dp greedy math sortings *1300	0 / 0	4
	2495	P1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	4
	2488	P1445A Array Rearrangment greedy sortings *800	0 / 0	3
	2487	P1445B Elimination greedy math *900	0 / 0	3
	2486	P1446A Knapsack constructive algorithms greedy sortings *1300	0 / 0	4
	2483	P1446D1 Frequency Problem (Easy Version) data structures greedy *2600	0 / 0	10
	2482	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	10
	2478	P1447B Numbers Box greedy math *1000	0 / 0	3
	2476	P1450B Balls of Steel brute force geometry greedy *1000	0 / 0	3
	2473	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2471	P1450F The Struggling Contestant constructive algorithms greedy *2400	0 / 0	9
	2467	P1451A Subtract or Divide greedy math *800	0 / 0	3
	2466	P1451B Non-Substring Subsequence dp greedy implementation strings *900	0 / 0	3
	2465	P1451C String Equality dp greedy hashing implementation strings *1400	0 / 0	4
	2459	P1452B Toy Blocks binary search greedy math sortings *1400	0 / 0	4
	2458	P1452C Two Brackets greedy *800	0 / 0	3
	2456	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2455	P1452F Divide Powers constructive algorithms greedy *2900	0 / 0	10
	2454	P1452G Game On Tree data structures dfs and similar greedy trees *2700	0 / 0	10
	2451	P1453C Triangles greedy implementation *1700	0 / 0	5
	2450	P1453D Checkpoints brute force constructive algorithms greedy math probabilities *1900	0 / 0	6
	2449	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2445	P1454C Sequence Transformation greedy implementation *1200	0 / 0	4
	2442	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2438	P1455D Sequence and Swaps dp greedy sortings *1600	0 / 0	5
	2437	P1455E Four Points brute force constructive algorithms flows geometry greedy implementation math ternary search *2400	0 / 0	9
	2436	P1455F String and Operations dp greedy *2800	0 / 0	10
	2434	P1456E XOR-ranges dp greedy *3500	0 / 0	10
	2430	P1458D Flip and Reverse data structures graphs greedy *3100	0 / 0	10
	2425	P1461A String Generation constructive algorithms greedy *800	0 / 0	3
	2421	P1461E Water Level brute force graphs greedy implementation math *2200	0 / 0	8
	2420	P1461F Mathematical Expression constructive algorithms dp greedy *2700	0 / 0	10
	2417	P1462C Unique Number brute force greedy math *900	0 / 0	3
	2416	P1462D Add to Neighbour and Remove greedy math number theory *1400	0 / 0	4
	2413	P1462F The Treasure of The Segments binary search data structures greedy *1800	0 / 0	6
	2411	P1463B Find The Array bitmasks constructive algorithms greedy *1400	0 / 0	4
	2409	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	2404	P1466B Last minute enhancements dp greedy *800	0 / 0	3
	2403	P1466C Canine poetry dp greedy strings *1300	0 / 0	4
	2402	P1466D 13th Labour of Heracles data structures greedy sortings trees *1500	0 / 0	5
	2400	P1466F Euclid's nightmare bitmasks dfs and similar dsu graphs greedy math sortings *2100	0 / 0	7
	2398	P1466H Finding satisfactory solutions combinatorics dp graphs greedy math *3300	0 / 0	10
	2396	P1467A Wizard of Orz constructive algorithms greedy math *900	0 / 0	3
	2394	P1467C Three Bags constructive algorithms greedy *1900	0 / 0	6
	2391	P1468A LaIS data structures dp greedy *2200	0 / 0	8
	2387	P1468E Four Segments greedy *800	0 / 0	3
	2384	P1468H K and Medians constructive algorithms greedy math *2200	0 / 0	8
	2382	P1468J Road Reform dsu graphs greedy *1800	0 / 0	6
	2380	P1468L Prime Divisors Selection binary search greedy math number theory *2700	0 / 0	10
	2378	P1468N Waste Sorting greedy implementation *900	0 / 0	3
	2377	P1469A Regular Bracket Sequence constructive algorithms greedy *1000	0 / 0	3
	2376	P1469B Red and Blue dp greedy *1000	0 / 0	3
	2375	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	5
	2372	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	10
	2371	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2368	P1470D Strange Housing constructive algorithms dfs and similar graph matchings graphs greedy *2200	0 / 0	8
	2365	P1471A Strange Partition greedy math number theory *900	0 / 0	3
	2364	P1471B Strange List brute force greedy implementation math *1100	0 / 0	3
	2363	P1472A Cards for Friends greedy math *800	0 / 0	3
	2362	P1472B Fair Division dp greedy math *800	0 / 0	3
	2360	P1472D Even-Odd Game dp games greedy sortings *1200	0 / 0	4
	2358	P1472F New Year's Puzzle brute force dp graph matchings greedy sortings *2100	0 / 0	7
	2356	P1473A Replacing Elements greedy implementation math sortings *800	0 / 0	3
	2349	P1474A Puzzle From the Future greedy *800	0 / 0	3
	2348	P1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	3
	2347	P1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	5
	2346	P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2345	P1474E What Is It? constructive algorithms greedy *2500	0 / 0	9
	2336	P1476A K-divisible Sum binary search constructive algorithms greedy math *1000	0 / 0	3
	2335	P1476B Inflation binary search brute force greedy math *1300	0 / 0	4
	2334	P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	5
	2328	P1477B Nezzar and Binary String data structures greedy *1900	0 / 0	6
	2327	P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	2325	P1477E Nezzar and Tournaments data structures greedy *3300	0 / 0	10
	2323	P1478A Nezzar and Colorful Balls brute force greedy *800	0 / 0	3
	2322	P1478B Nezzar and Lucky Number brute force dp greedy math *1100	0 / 0	3

Pick a problem randomly based on the current filter.