Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	3978	P1153C Serval and Parenthesis Sequence greedy strings *1700	0 / 0	5
	3977	P1153D Serval and Rooted Tree binary search dfs and similar dp greedy trees *1900	0 / 0	6
	3971	P1154D Walking Robot greedy *1500	0 / 0	5
	3969	P1154F Shovels Shop dp greedy sortings *2100	0 / 0	7
	3968	P1154G Minimum Possible LCM brute force greedy math number theory *2200	0 / 0	8
	3966	P1155B Game with Telephone Numbers games greedy implementation *1200	0 / 0	4
	3964	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	6
	3960	P1156B Ugly Pairs dfs and similar greedy implementation sortings strings *1800	0 / 0	6
	3959	P1156C Match Points binary search greedy sortings ternary search two pointers *2000	0 / 0	7
	3955	P1156G Optimizer graphs greedy hashing implementation *2700	0 / 0	10
	3953	P1157B Long Number greedy *1300	0 / 0	4
	3952	P1157C1 Increasing Subsequence (easy version) greedy *1300	0 / 0	4
	3951	P1157C2 Increasing Subsequence (hard version) greedy *1700	0 / 0	5
	3950	P1157D N Problems During K Days constructive algorithms greedy math *1900	0 / 0	6
	3949	P1157E Minimum Array binary search data structures greedy *1700	0 / 0	5
	3948	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	7
	3946	P1158A The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers *1500	0 / 0	5
	3944	P1158C Permutation recovery constructive algorithms data structures dfs and similar graphs greedy math sortings *2100	0 / 0	7
	3943	P1158D Winding polygonal line constructive algorithms geometry greedy math *2600	0 / 0	10
	3936	P1162B Double Matrix brute force greedy *1400	0 / 0	4
	3935	P1163A Eating Soup greedy math *900	0 / 0	3
	3926	P1165B Polycarp Training data structures greedy sortings *1000	0 / 0	3
	3925	P1165C Good String greedy *1300	0 / 0	4
	3923	P1165E Two Arrays and Sum of Functions greedy math sortings *1600	0 / 0	5
	3922	P1165F1 Microtransactions (easy version) binary search greedy *2000	0 / 0	7
	3921	P1165F2 Microtransactions (hard version) binary search greedy implementation *2000	0 / 0	7
	3920	P1166A Silent Classroom combinatorics greedy *900	0 / 0	3
	3917	P1166D Cute Sequences binary search brute force greedy math *2200	0 / 0	8
	3914	P1167A Telephone Number brute force greedy strings *800	0 / 0	3
	3911	P1167D Bicolored RBS constructive algorithms greedy *1500	0 / 0	5
	3907	P1168A Increasing by Modulo binary search greedy *1700	0 / 0	5
	3895	P1170F Wheels *special problem binary search greedy	0 / 0	(None)
	3891	P1172A Nauuo and Cards greedy implementation *1800	0 / 0	6
	3884	P1173A Nauuo and Votes greedy *800	0 / 0	3
	3883	P1173B Nauuo and Chess constructive algorithms greedy *1100	0 / 0	3
	3882	P1174A Ehab Fails to Be Thanos constructive algorithms greedy sortings *1000	0 / 0	3
	3874	P1175C Electrification binary search brute force greedy *1600	0 / 0	5
	3873	P1175D Array Splitting greedy sortings *1900	0 / 0	6
	3872	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	8
	3869	P1176A Divide it! brute force greedy implementation *800	0 / 0	3
	3867	P1176C Lose it! dp greedy implementation *1300	0 / 0	4
	3866	P1176D Recover it! dfs and similar graphs greedy number theory sortings *1800	0 / 0	6
	3861	P1178A Prime Minister greedy *800	0 / 0	3
	3859	P1178C Tiles combinatorics greedy math *1300	0 / 0	4
	3858	P1178D Prime Graph constructive algorithms greedy math number theory *1500	0 / 0	5
	3857	P1178E Archaeology brute force constructive algorithms greedy strings *1900	0 / 0	6
	3850	P1179C Serge and Dining Room binary search data structures graph matchings greedy implementation math trees *2200	0 / 0	8
	3846	P1180B Nick and Array greedy implementation *1500	0 / 0	5
	3845	P1181A Chunga-Changa greedy math *1000	0 / 0	3
	3844	P1181B Split a Number greedy implementation strings *1500	0 / 0	5
	3840	P1181E2 A Story of One Country (Hard) brute force greedy sortings *3000	0 / 0	10
	3837	P1182C Beautiful Lyrics data structures greedy strings *1700	0 / 0	5
	3830	P1183D Candy Box (easy version) greedy sortings *1400	0 / 0	4
	3827	P1183G Candy Box (hard version) greedy implementation sortings *2000	0 / 0	7
	3809	P1185C1 Exam in BerSU (easy version) greedy sortings *1200	0 / 0	4
	3808	P1185C2 Exam in BerSU (hard version) brute force data structures greedy math *1700	0 / 0	5
	3800	P1186D Vus the Cossack and Numbers constructive algorithms greedy math *1500	0 / 0	5
	3798	P1186F Vus the Cossack and a Graph dfs and similar graphs greedy implementation *2400	0 / 0	9
	3795	P1187C Vasya And Array constructive algorithms greedy implementation *1800	0 / 0	6
	3783	P1189B Number Circle greedy math sortings *1100	0 / 0	3
	3779	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	8
	3777	P1190E Tokitsukaze and Explosion binary search greedy *3100	0 / 0	10
	3760	P1195A Drinks Choosing greedy math *1000	0 / 0	3
	3746	P1197A DIY Wooden Ladder greedy math sortings *900	0 / 0	3
	3745	P1197B Pillars greedy implementation *1000	0 / 0	3
	3744	P1197C Array Splitting greedy sortings *1400	0 / 0	4
	3743	P1197D Yet Another Subarray Problem dp greedy math *1900	0 / 0	6
	3738	P1198C Matching vs Independent Set constructive algorithms graphs greedy sortings *2000	0 / 0	7
	3735	P1198F GCD Groups 2 greedy number theory probabilities *2900	0 / 0	10
	3731	P1200B Block Adventure dp greedy *1200	0 / 0	4
	3725	P1201B Zero Array greedy math *1500	0 / 0	5
	3724	P1201C Maximum Median binary search greedy math sortings *1400	0 / 0	4
	3723	P1201D Treasure Hunting binary search dp greedy implementation *2100	0 / 0	7
	3720	P1202A You Are Given Two Binary Strings... bitmasks greedy *1100	0 / 0	3
	3718	P1202C You Are Given a WASD-string... brute force data structures dp greedy implementation math strings *2100	0 / 0	7
	3713	P1203B Equal Rectangles greedy math *1200	0 / 0	4
	3711	P1203D1 Remove the Substring (easy version) greedy implementation *1600	0 / 0	5
	3710	P1203D2 Remove the Substring (hard version) binary search greedy implementation two pointers *1700	0 / 0	5
	3709	P1203E Boxers greedy sortings *1500	0 / 0	5
	3708	P1203F1 Complete the Projects (easy version) greedy *2100	0 / 0	7
	3707	P1203F2 Complete the Projects (hard version) dp greedy *2300	0 / 0	8
	3705	P1204B Mislove Has Lost an Array greedy math *900	0 / 0	3
	3704	P1204C Anna, Svyatoslav and Maps dp graphs greedy shortest paths *1700	0 / 0	5
	3703	P1204D1 Kirk and a Binary String (easy version) brute force greedy strings *2000	0 / 0	7
	3702	P1204D2 Kirk and a Binary String (hard version) data structures greedy math strings *2100	0 / 0	7
	3700	P1205A Almost Equal constructive algorithms greedy math *1200	0 / 0	4
	3692	P1207A There Are Two Types Of Burgers brute force greedy implementation math *800	0 / 0	3
	3691	P1207B Square Filling constructive algorithms greedy implementation *1200	0 / 0	4
	3690	P1207C Gas Pipeline dp greedy *1500	0 / 0	5
	3682	P1208D Restore Permutation binary search data structures greedy implementation *1900	0 / 0	6
	3680	P1208F Bits And Pieces bitmasks dfs and similar dp greedy *2600	0 / 0	10
	3679	P1208G Polygons greedy math number theory *2800	0 / 0	10
	3677	P1209A Paint the Numbers greedy implementation math *800	0 / 0	3
	3675	P1209C Paint the Digits constructive algorithms greedy implementation *1500	0 / 0	5
	3673	P1209E1 Rotate Columns (easy version) bitmasks brute force dp greedy sortings *2000	0 / 0	7
	3672	P1209E2 Rotate Columns (hard version) bitmasks dp greedy sortings *2500	0 / 0	9
	3670	P1209G1 Into Blocks (easy version) data structures dsu greedy implementation two pointers *2000	0 / 0	7
	3668	P1209H Moving Walkways data structures greedy math *3300	0 / 0	10
	3666	P1210B Marcin and Training Camp brute force greedy *1700	0 / 0	5
	3657	P1211C Ice Cream special problem greedy sortings 1700	0 / 0	5

Pick a problem randomly based on the current filter.