Problem Set - greedy - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9283	P3A Shortest path of the king greedy shortest paths *1000	0 / 0	3
	9282	P3B Lorry greedy sortings *1900	0 / 0	6
	9280	P3D Least Cost Bracket Sequence greedy *2600	0 / 0	10
	9278	P4B Before an Exam constructive algorithms greedy *1200	0 / 0	4
	9273	P5C Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900	0 / 0	6
	9268	P6C Alice, Bob and Chocolate greedy two pointers *1200	0 / 0	4
	9241	P11E Forward, march! binary search dp greedy *2800	0 / 0	10
	9238	P12C Fruits greedy implementation sortings *1100	0 / 0	3
	9219	P16B Burglar and Matches greedy implementation sortings *900	0 / 0	3
	9214	P17B Hierarchy dfs and similar dsu greedy shortest paths *1500	0 / 0	5
	9207	P18D Seller Bob brute force dp greedy *2000	0 / 0	7
	9203	P19C Deletion of Repeats greedy hashing string suffix structures *2200	0 / 0	8
	9190	P22D Segments greedy sortings *1900	0 / 0	6
	9188	P23A You're Given a String... brute force greedy *1200	0 / 0	4
	9172	P26B Regular Bracket Sequence greedy *1400	0 / 0	4
	9171	P26C Parquet combinatorics constructive algorithms greedy implementation *2000	0 / 0	7
	9167	P27B Tournament bitmasks brute force dfs and similar greedy *1300	0 / 0	4
	9166	P27C Unordered Subsequence constructive algorithms greedy *1900	0 / 0	6
	9150	P30D King's Problem? geometry greedy *2600	0 / 0	10
	9149	P30E Tricky and Clever Password binary search constructive algorithms data structures greedy hashing strings *2800	0 / 0	10
	9147	P31B Sysadmin Bob greedy implementation strings *1500	0 / 0	5
	9138	P33A What is for dinner? greedy implementation *1200	0 / 0	4
	9136	P33C Wonderful Randomized Sum greedy *1800	0 / 0	6
	9132	P34B Sale greedy sortings *900	0 / 0	3
	9125	P35D Animals dp greedy *1700	0 / 0	5
	9117	P37B Computer Game greedy implementation *1800	0 / 0	6
	9116	P37C Old Berland Language data structures greedy trees *1900	0 / 0	6
	9114	P37E Trial for Chief graphs greedy shortest paths *2600	0 / 0	10
	9105	P39A C++ Calculations expression parsing greedy 2000	0 / 0	7
	9104	P39B Company Income Growth greedy *1300	0 / 0	4
	9085	P41E 3-cycles constructive algorithms graphs greedy *1900	0 / 0	6
	9084	P42A Guilty — to the kitchen! greedy implementation *1400	0 / 0	4
	9077	P43C Lucky Tickets greedy *1300	0 / 0	4
	9065	P44J Triminoes constructive algorithms greedy *2000	0 / 0	7
	9061	P45D Event Dates greedy meet-in-the-middle sortings *1900	0 / 0	6
	9060	P45E Director constructive algorithms greedy *2000	0 / 0	7
	9059	P45F Goats and Wolves greedy *2500	0 / 0	9
	9056	P45I TCMCF+++ greedy *1400	0 / 0	4
	9039	P48D Permutations greedy *1500	0 / 0	5
	9037	P48F Snow sellers greedy sortings *2800	0 / 0	10
	9029	P50A Domino piling greedy math *800	0 / 0	3
	9022	P51C Three Base Stations binary search greedy *1800	0 / 0	6
	8995	P57A Square Earth? dfs and similar greedy implementation *1300	0 / 0	4
	8990	P58A Chat room greedy strings *1000	0 / 0	3
	8989	P58B Coins greedy *1300	0 / 0	4
	8987	P58D Calendar greedy strings *2000	0 / 0	7
	8982	P59D Team Arrangement constructive algorithms greedy implementation *2000	0 / 0	7
	8972	P61D Eternal Victory dfs and similar graphs greedy shortest paths trees *1800	0 / 0	6
	8970	P62A A Student's Dream greedy math *1300	0 / 0	4
	8958	P64C Table special problem greedy implementation math 1600	0 / 0	5
	8957	P64D Presents special problem greedy 1800	0 / 0	6
	8950	P65B Harry Potter and the History of Magic brute force greedy implementation *1700	0 / 0	5
	8941	P67A Partial Teacher dp graphs greedy implementation *1800	0 / 0	6
	8940	P67B Restoration of the Permutation greedy *1800	0 / 0	6
	8834	P69B Bets greedy implementation *1200	0 / 0	4
	8829	P70B Text Messaging expression parsing greedy strings *1600	0 / 0	5
	8820	P72A Goshtasp, Vishtasp and Eidi special problem greedy math 1800	0 / 0	6
	8815	P72F Oil special problem greedy math 1900	0 / 0	6
	8811	P73A The Elder Trolls IV: Oblivon greedy math *1600	0 / 0	5
	8810	P73B Need For Brake binary search greedy sortings *2000	0 / 0	7
	8808	P73D FreeDiv dfs and similar graphs greedy *2200	0 / 0	8
	8804	P74B Train dp games greedy *1500	0 / 0	5
	8797	P75D Big Maximum Sum data structures dp greedy implementation math trees *2000	0 / 0	7
	8794	P76B Mice greedy two pointers *2100	0 / 0	7
	8792	P76D Plus and xor dp greedy math *1700	0 / 0	5
	8787	P77C Beavermuncher-0xFF dfs and similar dp dsu greedy trees *2100	0 / 0	7
	8779	P79A Bus Game greedy *1200	0 / 0	4
	8777	P79C Beaver data structures dp greedy hashing strings two pointers *1800	0 / 0	6
	8770	P81C Average Score greedy math sortings *1700	0 / 0	5
	8769	P81D Polycarp's Picture Gallery constructive algorithms greedy *2100	0 / 0	7
	8760	P83C Track graphs greedy shortest paths *2400	0 / 0	9
	8754	P85B Embassy Queue data structures greedy *1800	0 / 0	6
	8749	P86B Tetris revisited constructive algorithms graph matchings greedy math *2200	0 / 0	8
	8738	P89A Robbery greedy *1800	0 / 0	6
	8734	P89E Fire and Ice greedy *2900	0 / 0	10
	8733	P90A Cableway greedy math *1000	0 / 0	3
	8731	P91A Newspaper Headline greedy strings *1500	0 / 0	5
	8728	P91D Grocer's Problem constructive algorithms graphs greedy *2600	0 / 0	10
	8725	P92B Binary Number greedy *1300	0 / 0	4
	8723	P93B End of Exams greedy *1900	0 / 0	6
	8716	P95B Lucky Numbers dp greedy *1800	0 / 0	6
	8689	P100J Interval Coloring special problem greedy math 2400	0 / 0	9
	8688	P101A Homework greedy *1200	0 / 0	4
	8685	P101D Castle dp greedy probabilities sortings trees *2300	0 / 0	8
	8681	P103A Testing Pants for Sadness greedy implementation math *1100	0 / 0	3
	8679	P103C Russian Roulette constructive algorithms greedy *1900	0 / 0	6
	8651	P111A Petya and Inequiations greedy *1400	0 / 0	4
	8636	P115B Lawnmower greedy sortings *1500	0 / 0	5
	8631	P116B Little Pigs and Wolves greedy implementation *1100	0 / 0	3
	8623	P118C Fancy Number brute force greedy sortings strings *1900	0 / 0	6
	8610	P120F Spiders dp greedy trees *1400	0 / 0	4
	8607	P120I Luck is in Numbers greedy *2200	0 / 0	8
	8596	P123C Brackets combinatorics dp greedy *2300	0 / 0	8
	8589	P125C Hobbits' Party constructive algorithms greedy *1600	0 / 0	5
	8588	P125D Two progressions constructive algorithms greedy *2200	0 / 0	8
	8584	P126C E-reader Display constructive algorithms greedy *2000	0 / 0	7
	8553	P132D Constants in the language of Shakespeare constructive algorithms dp greedy *2100	0 / 0	7
	8547	P134C Swaps constructive algorithms graphs greedy *2200	0 / 0	8
	8546	P135A Replacement greedy implementation sortings *1300	0 / 0	4
	8544	P135C Zero-One constructive algorithms games greedy *1900	0 / 0	6

Pick a problem randomly based on the current filter.