Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2794	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	2792	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	2789	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	4
	2788	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	2787	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	8
	2785	P1385B Restore the Permutation by Merger greedy *800	0 / 0	3
	2784	P1385C Make It Good greedy *1200	0 / 0	4
	2781	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	2775	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	2772	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	3
	2771	P1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	3
	2770	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	6
	2769	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	2767	P1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	3
	2766	P1389B Array Walk brute force dp greedy *1600	0 / 0	5
	2765	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	2764	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	7
	2759	P1391B Fix You brute force greedy implementation *800	0 / 0	3
	2757	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7
	2756	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	2755	P1392A Omkar and Password greedy math *800	0 / 0	3
	2753	P1392C Omkar and Waterslide greedy implementation *1200	0 / 0	4
	2752	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	5
	2750	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	9
	2746	P1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	3
	2745	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	4
	2744	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	5
	2740	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	2737	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	10
	2733	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	2732	P1396A Multiples of Length constructive algorithms greedy number theory *1600	0 / 0	5
	2731	P1396B Stoned Game brute force constructive algorithms games greedy *1800	0 / 0	6
	2730	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	8
	2727	P1397A Juggling Letters greedy strings *800	0 / 0	3
	2724	P1398B Substring Removal Game games greedy sortings *800	0 / 0	3
	2722	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	6
	2721	P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	8
	2720	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	2718	P1399A Remove Smallest greedy sortings *800	0 / 0	3
	2717	P1399B Gifts Fixing greedy *800	0 / 0	3
	2716	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	4
	2715	P1399D Binary String To Subsequences constructive algorithms data structures greedy implementation *1500	0 / 0	5
	2714	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	2713	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	2710	P1400B RPG Protagonist brute force greedy math *1700	0 / 0	5
	2709	P1400C Binary String Reconstruction 2-sat brute force constructive algorithms greedy *1500	0 / 0	5
	2707	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	8
	2703	P1401B Ternary Sequence constructive algorithms greedy math *1100	0 / 0	3
	2701	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2690	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2685	P1406A Subset Mex greedy implementation math *900	0 / 0	3
	2684	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	2682	P1406D Three Sequences constructive algorithms data structures greedy math *2200	0 / 0	8
	2679	P1407B Big Vova brute force greedy math number theory *1300	0 / 0	4
	2676	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2674	P1408B Arrays Sum constructive algorithms greedy math *1400	0 / 0	4
	2671	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9
	2668	P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	10
	2666	P1409A Yet Another Two Integers Problem greedy math *800	0 / 0	3
	2665	P1409B Minimum Product brute force greedy math *1100	0 / 0	3
	2663	P1409D Decrease the Sum of Digits greedy math *1500	0 / 0	5
	2657	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	2656	P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	8
	2655	P1411F The Thorny Path greedy math *3000	0 / 0	10
	2650	P1413D Shurikens data structures greedy implementation *1700	0 / 0	5
	2649	P1413E Solo mid Oracle greedy math ternary search *2100	0 / 0	7
	2646	P1415B Repainting Street brute force brute force greedy *1100	0 / 0	3
	2643	P1415E New Game Plus! constructive algorithms greedy math *2200	0 / 0	8
	2640	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	7
	2639	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2637	P1416E Split binary search data structures dp greedy *3200	0 / 0	10
	2636	P1416F Showing Off flows graph matchings greedy implementation *3300	0 / 0	10
	2635	P1417A Copy-paste greedy math *800	0 / 0	3
	2634	P1417B Two Arrays greedy math sortings *1100	0 / 0	3
	2632	P1418B Negative Prefixes greedy sortings *1300	0 / 0	4
	2631	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	5
	2626	P1419A Digit Game games greedy implementation *900	0 / 0	3
	2625	P1419B Stairs brute force constructive algorithms greedy implementation math *1200	0 / 0	4
	2624	P1419C Killjoy greedy implementation math *1500	0 / 0	5
	2623	P1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	3
	2622	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	2617	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	2616	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2614	P1420E Battle Lemmings dp greedy *2500	0 / 0	9
	2613	P1421A XORwice bitmasks greedy math *800	0 / 0	3
	2610	P1421D Hexagons brute force constructive algorithms greedy implementation math shortest paths *1900	0 / 0	6
	2607	P1422B Nice Matrix greedy implementation math *1300	0 / 0	4
	2604	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	10
	2586	P1425A Arena of Greed games greedy *1400	0 / 0	4
	2582	P1425E Excitation of Atoms greedy implementation *2200	0 / 0	8
	2575	P1426D Non-zero Segments constructive algorithms data structures greedy sortings *1500	0 / 0	5
	2574	P1426E Rock, Paper, Scissors brute force constructive algorithms flows greedy math *1800	0 / 0	6
	2571	P1427B Chess Cheater greedy implementation sortings *1400	0 / 0	4
	2567	P1427F Boring Card Game data structures greedy trees *3200	0 / 0	10
	2562	P1428C ABBB brute force data structures greedy strings *1100	0 / 0	3
	2561	P1428D Bouncing Boomerangs constructive algorithms greedy implementation *1900	0 / 0	6
	2560	P1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	8
	2558	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	10
	2557	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	10
	2554	P1430B Barrels greedy implementation sortings *800	0 / 0	3

Pick a problem randomly based on the current filter.