Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6948	P513F2 Scaygerboss flows *2800	0 / 0	10
	6947	P513G1 Inversions problem brute force dfs and similar dp meet-in-the-middle *1800	0 / 0	6
	6946	P513G2 Inversions problem dp probabilities *2400	0 / 0	9
	6945	P513G3 Inversions problem dp *3100	0 / 0	10
	6944	P514A Chewbaсca and Number greedy implementation *1200	0 / 0	4
	6943	P514B Han Solo and Lazer Gun brute force data structures geometry implementation math *1400	0 / 0	4
	6942	P514C Watto and Mechanism binary search data structures hashing string suffix structures strings *2000	0 / 0	7
	6941	P514D R2D2 and Droid Army binary search data structures two pointers *2000	0 / 0	7
	6940	P514E Darth Vader and Tree dp matrices *2200	0 / 0	8
	6939	P515A Drazil and Date math *1000	0 / 0	3
	6938	P515B Drazil and His Happy Friends brute force dsu meet-in-the-middle number theory *1300	0 / 0	4
	6937	P515C Drazil and Factorial greedy math sortings *1400	0 / 0	4
	6936	P515D Drazil and Tiles constructive algorithms greedy *2000	0 / 0	7
	6935	P515E Drazil and Park data structures *2300	0 / 0	8
	6934	P516D Drazil and Morning Exercise dfs and similar dp dsu trees two pointers *2800	0 / 0	10
	6933	P516E Drazil and His Happy Friends math number theory *3100	0 / 0	10
	6932	P518A Vitaly and Strings constructive algorithms strings *1600	0 / 0	5
	6931	P518B Tanya and Postcard greedy implementation strings *1400	0 / 0	4
	6930	P518C Anya and Smartphone constructive algorithms data structures implementation *1600	0 / 0	5
	6929	P518D Ilya and Escalator combinatorics dp math probabilities *1700	0 / 0	5
	6928	P518E Arthur and Questions greedy implementation math ternary search *2200	0 / 0	8
	6927	P518F Pasha and Pipe binary search brute force combinatorics dp implementation *2300	0 / 0	8
	6926	P519A A and B and Chess implementation *900	0 / 0	3
	6925	P519B A and B and Compilation Errors data structures implementation sortings *1100	0 / 0	3
	6924	P519C A and B and Team Training greedy implementation math number theory *1300	0 / 0	4
	6923	P519D A and B and Interesting Substrings data structures dp two pointers *1800	0 / 0	6
	6922	P519E A and B and Lecture Rooms binary search data structures dfs and similar dp trees *2100	0 / 0	7
	6921	P520A Pangram implementation strings *800	0 / 0	3
	6920	P520B Two Buttons dfs and similar graphs greedy implementation math shortest paths *1400	0 / 0	4
	6919	P520C DNA Alignment math strings *1500	0 / 0	5
	6918	P520D Cubes games greedy implementation *2100	0 / 0	7
	6917	P520E Pluses everywhere combinatorics dp math number theory *2200	0 / 0	8
	6916	P521D Shop greedy *2800	0 / 0	10
	6915	P521E Cycling City dfs and similar graphs *3100	0 / 0	10
	6914	P522A Reposts special problem dfs and similar dp graphs trees 1200	0 / 0	4
	6913	P522B Photo to Remember special problem data structures dp implementation 1100	0 / 0	3
	6912	P522C Chicken or Fish? greedy *2100	0 / 0	7
	6911	P522D Closest Equals special problem data structures 2000	0 / 0	7
	6910	P523A Rotate, Flip and Zoom special problem implementation 1200	0 / 0	4
	6909	P523B Mean Requests special problem implementation 1500	0 / 0	5
	6908	P523C Name Quest special problem greedy 1400	0 / 0	4
	6907	P523D Statistics of Recompressing Videos special problem data structures implementation 1600	0 / 0	5
	6906	P524C The Art of Dealing with ATM binary search sortings *1900	0 / 0	6
	6905	P524D Social Network greedy two pointers *2100	0 / 0	7
	6904	P524E Rooks and Rectangles data structures sortings *2400	0 / 0	9
	6903	P524F And Yet Another Bracket Sequence data structures greedy hashing string suffix structures strings *2700	0 / 0	10
	6902	P525A Vitaliy and Pie greedy hashing strings *1100	0 / 0	3
	6901	P525B Pasha and String constructive algorithms greedy math strings *1400	0 / 0	4
	6900	P525C Ilya and Sticks greedy math sortings *1600	0 / 0	5
	6899	P525D Arthur and Walls constructive algorithms data structures graphs greedy shortest paths *2400	0 / 0	9
	6898	P525E Anya and Cubes binary search bitmasks brute force dp math meet-in-the-middle *2100	0 / 0	7
	6897	P526A King of Thieves brute force implementation *1300	0 / 0	4
	6896	P526B Om Nom and Dark Park dfs and similar greedy implementation *1400	0 / 0	4
	6895	P526C Om Nom and Candies brute force greedy math *2000	0 / 0	7
	6894	P526D Om Nom and Necklace hashing string suffix structures strings *2200	0 / 0	8
	6893	P526E Transmitting Levels dp implementation *2400	0 / 0	9
	6892	P526F Pudding Monsters data structures divide and conquer *3000	0 / 0	10
	6891	P526G Spiders Evil Plan greedy trees *3300	0 / 0	10
	6890	P527A Playing with Paper implementation math *1100	0 / 0	3
	6889	P527B Error Correct System greedy *1500	0 / 0	5
	6888	P527C Glass Carving binary search data structures implementation *1500	0 / 0	5
	6887	P527D Clique Problem data structures dp greedy implementation sortings *1800	0 / 0	6
	6886	P527E Data Center Drama dfs and similar graphs *2600	0 / 0	10
	6885	P528D Fuzzy Search bitmasks brute force fft *2500	0 / 0	9
	6884	P528E __NO_TITLE__	0 / 0	(None)
	6883	P529B Group Photo 2 (online mirror version) brute force greedy sortings *1900	0 / 0	6
	6882	P530A Quadratic equation special problem 1500	0 / 0	5
	6881	P530B String inside out special problem 1600	0 / 0	5
	6880	P530C Diophantine equation special problem 1500	0 / 0	5
	6879	P530D Set subtraction special problem 1600	0 / 0	5
	6878	P530E Sum and product special problem 1700	0 / 0	5
	6877	P530F Jumping frogs special problem 2100	0 / 0	7
	6876	P530G Levenshtein distance special problem 2100	0 / 0	7
	6875	P530H Points in triangle special problem geometry 2100	0 / 0	7
	6874	P530I Different variables special problem 2500	0 / 0	9
	6873	P533A Berland Miners binary search data structures dfs and similar greedy trees *3000	0 / 0	10
	6872	P533B Work Group dfs and similar dp graphs strings trees *2000	0 / 0	7
	6871	P533C Board Game games greedy implementation math *1700	0 / 0	5
	6870	P533D Landmarks data structures dp *3000	0 / 0	10
	6869	P533E Correcting Mistakes constructive algorithms dp greedy hashing strings two pointers *1800	0 / 0	6
	6868	P533F Encoding hashing string suffix structures strings *2400	0 / 0	9
	6867	P534A Exam constructive algorithms implementation math *1100	0 / 0	3
	6866	P534B Covered Path dp greedy math *1400	0 / 0	4
	6865	P534C Polycarpus' Dice math *1600	0 / 0	5
	6864	P534D Handshakes binary search constructive algorithms data structures greedy *1900	0 / 0	6
	6863	P534E Berland Local Positioning System constructive algorithms greedy hashing implementation *2400	0 / 0	9
	6862	P534F Simplified Nonogram bitmasks dp hashing meet-in-the-middle *2400	0 / 0	9
	6861	P535A Tavas and Nafas brute force implementation *1000	0 / 0	3
	6860	P535B Tavas and SaDDas bitmasks brute force combinatorics implementation *1100	0 / 0	3
	6859	P535C Tavas and Karafs binary search greedy math *1900	0 / 0	6
	6858	P535D Tavas and Malekas greedy hashing string suffix structures strings *1900	0 / 0	6
	6857	P535E Tavas and Pashmaks geometry math *2600	0 / 0	10
	6856	P536D Tavas in Kansas dp games *2900	0 / 0	10
	6855	P536E Tavas on the Path data structures divide and conquer trees *3100	0 / 0	10
	6854	P538A Cutting Banner brute force implementation *1400	0 / 0	4
	6853	P538B Quasi Binary constructive algorithms dp greedy implementation *1400	0 / 0	4
	6852	P538C Tourist's Notes binary search brute force greedy implementation math *1600	0 / 0	5
	6851	P538D Weird Chess brute force constructive algorithms implementation *1800	0 / 0	6
	6850	P538E Demiurges Play Again dfs and similar dp math trees *2200	0 / 0	8
	6849	P538F A Heap of Heaps brute force data structures math sortings *2200	0 / 0	8

Pick a problem randomly based on the current filter.