Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5739	P774J Stepan's Series special problem dp 2000	0 / 0	7
	5738	P774K Stepan and Vowels special problem implementation strings 1600	0 / 0	5
	5737	P774L Bars special problem binary search 2000	0 / 0	7
	5736	P775A University Schedule special problem 2900	0 / 0	10
	5735	P776A A Serial Killer brute force implementation strings *900	0 / 0	3
	5734	P776B Sherlock and his girlfriend constructive algorithms number theory *1200	0 / 0	4
	5733	P776C Molly's Chemicals binary search brute force data structures implementation math *1800	0 / 0	6
	5732	P776D The Door Problem 2-sat dfs and similar dsu graphs *2000	0 / 0	7
	5731	P776E The Holmes Children math number theory *2100	0 / 0	7
	5730	P776F Sherlock's bet to Moriarty constructive algorithms data structures divide and conquer geometry graphs implementation trees *2800	0 / 0	10
	5729	P776G Sherlock and the Encrypted Data bitmasks combinatorics dp *2900	0 / 0	10
	5728	P777A Shell Game constructive algorithms implementation math *1000	0 / 0	3
	5727	P777B Game of Credit Cards data structures dp greedy sortings *1300	0 / 0	4
	5726	P777C Alyona and Spreadsheet binary search data structures dp greedy implementation two pointers *1600	0 / 0	5
	5725	P777D Cloud of Hashtags binary search greedy implementation strings *1800	0 / 0	6
	5724	P777E Hanoi Factory brute force data structures dp greedy sortings *2000	0 / 0	7
	5723	P778A String Game binary search greedy strings *1700	0 / 0	5
	5722	P778B Bitwise Formula bitmasks brute force dfs and similar expression parsing implementation *1800	0 / 0	6
	5721	P778C Peterson Polyglot brute force dfs and similar dsu hashing strings trees *2500	0 / 0	9
	5720	P778D Parquet Re-laying constructive algorithms *2700	0 / 0	10
	5719	P778E Selling Numbers dp sortings *3000	0 / 0	10
	5718	P779A Pupils Redistribution constructive algorithms math *1000	0 / 0	3
	5717	P779B Weird Rounding brute force greedy *1100	0 / 0	3
	5716	P779C Dishonest Sellers constructive algorithms greedy sortings *1200	0 / 0	4
	5715	P780A Andryusha and Socks implementation *800	0 / 0	3
	5714	P780B The Meeting Place Cannot Be Changed binary search *1600	0 / 0	5
	5713	P780C Andryusha and Colored Balloons dfs and similar graphs greedy trees *1600	0 / 0	5
	5712	P780D Innokenty and a Football League 2-sat graphs greedy implementation shortest paths strings *1900	0 / 0	6
	5711	P780E Underground Lab constructive algorithms dfs and similar graphs *2100	0 / 0	7
	5710	P780F Axel and Marston in Bitland bitmasks dp graphs matrices *2400	0 / 0	9
	5709	P780G Andryusha and Nervous Barriers data structures dp *2700	0 / 0	10
	5708	P780H Intranet of Buses binary search geometry implementation two pointers *3100	0 / 0	10
	5707	P784A Numbers Joke special problem 1700	0 / 0	5
	5706	P784B Kids' Riddle special problem 2000	0 / 0	7
	5705	P784C INTERCALC special problem implementation 1800	0 / 0	6
	5704	P784D Touchy-Feely Palindromes special problem implementation 1900	0 / 0	6
	5703	P784E Twisted Circuit special problem brute force implementation 2000	0 / 0	7
	5702	P784F Crunching Numbers Just for You special problem implementation 1900	0 / 0	6
	5701	P784G BF Calculator special problem 2000	0 / 0	7
	5700	P785A Anton and Polyhedrons implementation strings *800	0 / 0	3
	5699	P785B Anton and Classes greedy sortings *1100	0 / 0	3
	5698	P785C Anton and Fairy Tale binary search math *1600	0 / 0	5
	5697	P785D Anton and School - 2 combinatorics dp math number theory *2300	0 / 0	8
	5696	P785E Anton and Permutation brute force data structures *2200	0 / 0	8
	5695	P786A Berzerk dfs and similar dp games *2000	0 / 0	7
	5694	P786B Legacy data structures graphs shortest paths *2300	0 / 0	8
	5693	P786C Till I Collapse data structures divide and conquer *2400	0 / 0	9
	5692	P786D Rap God data structures dfs and similar hashing strings trees *3400	0 / 0	10
	5691	P786E ALT data structures flows graphs trees *3200	0 / 0	10
	5690	P787A The Monster brute force math number theory *1200	0 / 0	4
	5689	P787B Not Afraid greedy implementation math *1300	0 / 0	4
	5688	P788A Functions again dp two pointers *1600	0 / 0	5
	5687	P788B Weird journey combinatorics constructive algorithms dfs and similar dsu graphs *2100	0 / 0	7
	5686	P788C The Great Mixing dfs and similar graphs shortest paths *2300	0 / 0	8
	5685	P788D Finding lines constructive algorithms divide and conquer interactive *3000	0 / 0	10
	5684	P788E New task data structures *2900	0 / 0	10
	5683	P789A Anastasia and pebbles implementation math *1100	0 / 0	3
	5682	P789B Masha and geometric depression brute force implementation math *1700	0 / 0	5
	5681	P791A Bear and Big Brother implementation *800	0 / 0	3
	5680	P792A New Bus Route implementation sortings *1100	0 / 0	3
	5679	P792B Counting-out Rhyme implementation *1300	0 / 0	4
	5678	P792C Divide by Three dp greedy math number theory *2000	0 / 0	7
	5677	P792D Paths in a Complete Binary Tree bitmasks trees *1900	0 / 0	6
	5676	P792E Colored Balls greedy math number theory *2500	0 / 0	9
	5675	P792F Mages and Monsters data structures geometry *3100	0 / 0	10
	5674	P793A Oleg and shares implementation math *900	0 / 0	3
	5673	P793B Igor and his way to work dfs and similar graphs implementation shortest paths *1600	0 / 0	5
	5672	P793C Mice problem geometry implementation math sortings *2300	0 / 0	8
	5671	P793D Presents in Bankopolis dp graphs shortest paths *2100	0 / 0	7
	5670	P793E Problem of offices constructive algorithms dfs and similar dp trees *2900	0 / 0	10
	5669	P793F Julia the snail data structures divide and conquer dp *3000	0 / 0	10
	5668	P793G Oleg and chess data structures divide and conquer flows graph matchings *3400	0 / 0	10
	5667	P794A Bank Robbery brute force implementation *800	0 / 0	3
	5666	P794B Cutting Carrot geometry math *1200	0 / 0	4
	5665	P794C Naming Company games greedy sortings *1800	0 / 0	6
	5664	P794D Labelling Cities dfs and similar graphs hashing *2400	0 / 0	9
	5663	P794E Choosing Carrot games math *2800	0 / 0	10
	5662	P794F Leha and security system data structures *2800	0 / 0	10
	5661	P794G Replace All combinatorics dp math *3400	0 / 0	10
	5660	P796A Buying A House brute force implementation *800	0 / 0	3
	5659	P796B Find The Bone implementation *1300	0 / 0	4
	5658	P796C Bank Hacking constructive algorithms data structures dp trees *1900	0 / 0	6
	5657	P796D Police Stations constructive algorithms dfs and similar dp graphs shortest paths trees *2100	0 / 0	7
	5656	P796E Exam Cheating binary search dp *2400	0 / 0	9
	5655	P796F Sequence Recovery bitmasks data structures greedy *2800	0 / 0	10
	5654	P797A k-Factorization implementation math number theory *1100	0 / 0	3
	5653	P797B Odd sum dp greedy implementation *1400	0 / 0	4
	5652	P797C Minimal string data structures greedy strings *1700	0 / 0	5
	5651	P797D Broken BST data structures dfs and similar *2100	0 / 0	7
	5650	P797E Array Queries brute force data structures dp *2000	0 / 0	7
	5649	P797F Mice and Holes data structures dp greedy sortings *2600	0 / 0	10
	5648	P798A Mike and palindrome brute force constructive algorithms strings *1000	0 / 0	3
	5647	P798B Mike and strings brute force dp strings *1300	0 / 0	4
	5646	P798C Mike and gcd problem dp greedy number theory *1700	0 / 0	5
	5645	P798D Mike and distribution constructive algorithms sortings *2400	0 / 0	9
	5644	P798E Mike and code of a permutation constructive algorithms data structures graphs sortings *3000	0 / 0	10
	5643	P799A Carrot Cakes brute force implementation *1100	0 / 0	3
	5642	P799B T-shirt buying data structures implementation *1400	0 / 0	4
	5641	P799C Fountains binary search data structures implementation *1800	0 / 0	6
	5640	P799D Field expansion brute force dp meet-in-the-middle *2100	0 / 0	7

Pick a problem randomly based on the current filter.