Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6239	P661E Divisibility Check special problem 2000	0 / 0	7
	6238	P661F Primes in Interval special problem 1900	0 / 0	6
	6237	P661G Hungarian Notation special problem 2200	0 / 0	8
	6236	P661H Rotate Matrix special problem 2400	0 / 0	9
	6235	P662A Gambling Nim bitmasks math matrices probabilities *2400	0 / 0	9
	6234	P662B Graph Coloring dfs and similar graphs *2200	0 / 0	8
	6233	P662C Binary Table bitmasks brute force divide and conquer dp fft math *2600	0 / 0	10
	6232	P662D International Olympiad constructive algorithms greedy implementation math *2000	0 / 0	7
	6231	P662E To Hack or not to Hack brute force dp greedy *3100	0 / 0	10
	6230	P663A Rebus constructive algorithms expression parsing greedy math *1800	0 / 0	6
	6229	P664A Complicated GCD math number theory *800	0 / 0	3
	6228	P665A Buses Between Cities implementation *1600	0 / 0	5
	6227	P665B Shopping brute force *1400	0 / 0	4
	6226	P665C Simple Strings dp greedy strings *1300	0 / 0	4
	6225	P665D Simple Subset constructive algorithms greedy number theory *1800	0 / 0	6
	6224	P665E Beautiful Subarrays data structures divide and conquer strings trees *2100	0 / 0	7
	6223	P665F Four Divisors data structures dp math number theory sortings two pointers *2400	0 / 0	9
	6222	P666A Reberland Linguistics dp implementation strings *1800	0 / 0	6
	6221	P666B World Tour graphs shortest paths *2000	0 / 0	7
	6220	P666C Codeword combinatorics strings *2500	0 / 0	9
	6219	P666D Chain Reaction brute force geometry *3000	0 / 0	10
	6218	P666E Forensic Examination data structures string suffix structures *3100	0 / 0	10
	6217	P667A Pouring Rain geometry math *1100	0 / 0	3
	6216	P667B Coat of Anticubism constructive algorithms geometry *1100	0 / 0	3
	6215	P669A Little Artem and Presents math *800	0 / 0	3
	6214	P670A Holidays brute force constructive algorithms greedy math *900	0 / 0	3
	6213	P670B Game of Robots implementation *1000	0 / 0	3
	6212	P670C Cinema implementation sortings *1300	0 / 0	4
	6211	P670D1 Magic Powder - 1 binary search brute force implementation *1400	0 / 0	4
	6210	P670D2 Magic Powder - 2 binary search implementation *1500	0 / 0	5
	6209	P670E Correct Bracket Sequence Editor data structures dsu strings *1700	0 / 0	5
	6208	P670F Restore a Number brute force constructive algorithms strings *2300	0 / 0	8
	6207	P671A Recycling Bottles dp geometry greedy implementation *1800	0 / 0	6
	6206	P671B Robin Hood binary search greedy *2000	0 / 0	7
	6205	P671C Ultimate Weirdness of an Array data structures number theory *2800	0 / 0	10
	6204	P671D Roads in Yusland data structures dp greedy *2900	0 / 0	10
	6203	P671E Organizing a Race data structures greedy *3300	0 / 0	10
	6202	P672A Summer Camp implementation *800	0 / 0	3
	6201	P672B Different is Good constructive algorithms implementation strings *1000	0 / 0	3
	6200	P673A Bear and Game implementation *800	0 / 0	3
	6199	P673B Problems for Round greedy implementation *1300	0 / 0	4
	6198	P675A Infinite Sequence math *1100	0 / 0	3
	6197	P675B Restoring Painting brute force constructive algorithms math *1400	0 / 0	4
	6196	P675C Money Transfers constructive algorithms data structures greedy sortings *2100	0 / 0	7
	6195	P675D Tree Construction data structures trees *1800	0 / 0	6
	6194	P675E Trains and Statistic data structures dp greedy *2300	0 / 0	8
	6193	P676A Nicholas and Permutation constructive algorithms implementation *800	0 / 0	3
	6192	P676B Pyramid of Glasses implementation math math *1500	0 / 0	5
	6191	P676C Vasya and String binary search dp strings two pointers *1500	0 / 0	5
	6190	P676D Theseus and labyrinth graphs implementation shortest paths *2000	0 / 0	7
	6189	P676E The Last Fight Between Human and AI math *2400	0 / 0	9
	6188	P677A Vanya and Fence implementation *800	0 / 0	3
	6187	P677B Vanya and Food Processor implementation math *1400	1 / 1	4
	6186	P677C Vanya and Label bitmasks combinatorics implementation strings *1500	0 / 0	5
	6185	P677D Vanya and Treasure data structures dp graphs shortest paths *2300	0 / 0	8
	6184	P677E Vanya and Balloons binary search brute force dp implementation *2300	0 / 0	8
	6183	P678A Johny Likes Numbers implementation math *800	0 / 0	3
	6182	P678B The Same Calendar implementation *1600	0 / 0	5
	6181	P678C Joty and Chocolate implementation math number theory *1600	0 / 0	5
	6180	P678D Iterated Linear Function math number theory *1700	0 / 0	5
	6179	P678E Another Sith Tournament bitmasks dp math probabilities *2200	0 / 0	8
	6178	P678F Lena and Queries data structures divide and conquer geometry *2500	0 / 0	9
	6177	P679A Bear and Prime 100 constructive algorithms interactive math *1400	0 / 0	4
	6176	P679B Bear and Tower of Cubes binary search dp greedy *2200	0 / 0	8
	6175	P679C Bear and Square Grid dfs and similar dsu implementation *2400	0 / 0	9
	6174	P679D Bear and Chase brute force dfs and similar graphs implementation math probabilities *2900	0 / 0	10
	6173	P679E Bear and Bad Powers of 42 data structures *3100	0 / 0	10
	6172	P680A Bear and Five Cards constructive algorithms implementation *800	0 / 0	3
	6171	P680B Bear and Finding Criminals constructive algorithms implementation *1000	0 / 0	3
	6170	P681A A Good Contest implementation *800	0 / 0	3
	6169	P681B Economy Game brute force *1300	0 / 0	4
	6168	P681C Heap Operations constructive algorithms data structures greedy *1600	0 / 0	5
	6167	P681D Gifts by the List constructive algorithms dfs and similar graphs trees *2000	0 / 0	7
	6166	P681E Runaway to a Shadow geometry sortings *2500	0 / 0	9
	6165	P682A Alyona and Numbers constructive algorithms math number theory *1100	0 / 0	3
	6164	P682B Alyona and Mex sortings *1200	0 / 0	4
	6163	P682C Alyona and the Tree dfs and similar dp graphs trees *1600	0 / 0	5
	6162	P682D Alyona and Strings dp strings *1900	0 / 0	6
	6161	P682E Alyona and Triangles geometry two pointers *2600	0 / 0	10
	6160	P683A The Check of the Point special problem geometry 1200	0 / 0	4
	6159	P683B The Teacher of Physical Education special problem 1600	0 / 0	5
	6158	P683C Symmetric Difference special problem 1600	0 / 0	5
	6157	P683D Chocolate Bar special problem math 1400	0 / 0	4
	6156	P683E Hammer throwing special problem 1800	0 / 0	6
	6155	P683F Reformat the String special problem 1800	0 / 0	6
	6154	P683G The Fraction special problem 1900	0 / 0	6
	6153	P683H Exchange of Books special problem 1900	0 / 0	6
	6152	P683I Loader special problem graphs 2500	0 / 0	9
	6151	P683J The Hero with Bombs special problem 3000	0 / 0	10
	6150	P685A Robbers' watch brute force combinatorics dp math *1700	0 / 0	5
	6149	P685B Kay and Snowflake data structures dfs and similar dp trees *1900	0 / 0	6
	6148	P685C Optimal Point binary search math *2900	0 / 0	10
	6147	P685D Kay and Eternity brute force implementation sortings *2600	0 / 0	10
	6146	P685E Travelling Through the Snow Queen's Kingdom bitmasks brute force divide and conquer graphs *2800	0 / 0	10
	6145	P686A Free Ice Cream constructive algorithms implementation *800	0 / 0	3
	6144	P686B Little Robber Girl's Zoo constructive algorithms implementation sortings *1100	0 / 0	3
	6143	P687A NP-Hard Problem dfs and similar graphs *1500	0 / 0	5
	6142	P687B Remainders Game chinese remainder theorem math number theory *1800	0 / 0	6
	6141	P687C The Values You Can Make dp *1900	0 / 0	6
	6140	P687D Dividing Kingdom II brute force data structures dsu graphs sortings *2500	0 / 0	9

Pick a problem randomly based on the current filter.