Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6339	P631E Product Sum data structures dp geometry *2600	0 / 0	10
	6338	P632A Grandma Laura and Apples *1200	0 / 0	4
	6337	P632B Alice, Bob, Two Teams brute force constructive algorithms *1400	0 / 0	4
	6336	P632C The Smallest String Concatenation sortings strings *1700	0 / 0	5
	6335	P632D Longest Subsequence brute force math number theory *2100	0 / 0	7
	6334	P632E Thief in a Shop divide and conquer dp fft math *2400	0 / 0	9
	6333	P632F Magic Matrix brute force divide and conquer graphs matrices trees *2400	0 / 0	9
	6332	P633A Ebony and Ivory brute force math number theory *1100	0 / 0	3
	6331	P633B A Trivial Problem brute force constructive algorithms math number theory *1300	0 / 0	4
	6330	P633C Spy Syndrome 2 data structures dp hashing implementation sortings string suffix structures strings *1900	0 / 0	6
	6329	P633D Fibonacci-ish brute force dp hashing implementation math *2000	0 / 0	7
	6328	P633E Startup Funding binary search constructive algorithms data structures probabilities two pointers *2400	0 / 0	9
	6327	P633F The Chocolate Spree dfs and similar dp graphs trees *2600	0 / 0	10
	6326	P633G Yash And Trees bitmasks data structures dfs and similar math number theory *2800	0 / 0	10
	6325	P633H Fibonacci-ish II data structures implementation *3100	0 / 0	10
	6324	P634A Island Puzzle constructive algorithms implementation *1300	0 / 0	4
	6323	P635A Orchestra brute force implementation *1100	0 / 0	3
	6322	P637A Voting for Photos special problem constructive algorithms implementation 1000	0 / 0	3
	6321	P637B Chat Order special problem binary search constructive algorithms data structures sortings 1200	0 / 0	4
	6320	P637C Promocodes with Mistakes special problem brute force constructive algorithms implementation 1400	0 / 0	4
	6319	P637D Running with Obstacles special problem data structures dp greedy 1600	0 / 0	5
	6318	P638A Home Numbers special problem constructive algorithms math 1100	0 / 0	3
	6317	P638B Making Genome in Berland special problem dfs and similar strings 1500	0 / 0	5
	6316	P638C Road Improvement special problem dfs and similar graphs greedy trees 1800	0 / 0	6
	6315	P638D Three-dimensional Turtle Super Computer brute force dfs and similar graphs *1800	0 / 0	6
	6314	P639A Bear and Displayed Friends implementation *1200	0 / 0	4
	6313	P639B Bear and Forgotten Tree 3 constructive algorithms graphs trees *1600	0 / 0	5
	6312	P639C Bear and Polynomials hashing implementation math *2200	0 / 0	8
	6311	P639D Bear and Contribution data structures greedy sortings two pointers *2400	0 / 0	9
	6310	P639E Bear and Paradox binary search greedy math sortings *2800	0 / 0	10
	6309	P639F Bear and Chemistry data structures dfs and similar graphs trees *3300	0 / 0	10
	6308	P641A Little Artem and Grasshopper implementation *1000	0 / 0	3
	6307	P641B Little Artem and Matrix implementation *1400	0 / 0	4
	6306	P641C Little Artem and Dance brute force constructive algorithms implementation *1800	0 / 0	6
	6305	P641D Little Artem and Random Variable dp implementation math probabilities *2400	0 / 0	9
	6304	P641E Little Artem and Time Machine data structures *2000	0 / 0	7
	6303	P641F Little Artem and 2-SAT *3000	0 / 0	10
	6302	P641G Little Artem and Graph *2300	0 / 0	8
	6301	P643A Bear and Colors implementation *1500	0 / 0	5
	6300	P643B Bear and Two Paths constructive algorithms graphs *1600	0 / 0	5
	6299	P643C Levels and Regions dp *2400	0 / 0	9
	6298	P643D Bearish Fanpages *2900	0 / 0	10
	6297	P643E Bear and Destroying Subtrees dp math probabilities trees *2700	0 / 0	10
	6296	P643F Bears and Juice dp math meet-in-the-middle *2900	0 / 0	10
	6295	P643G Choosing Ads data structures *3200	0 / 0	10
	6294	P644A Parliament of Berland special problem constructive algorithms 1000	0 / 0	3
	6293	P644B Processing Queries special problem constructive algorithms data structures two pointers 1700	0 / 0	5
	6292	P644C Hostname Aliases special problem binary search data structures implementation sortings strings 2100	0 / 0	7
	6291	P645A Amity Assessment brute force constructive algorithms implementation *1200	0 / 0	4
	6290	P645B Mischievous Mess Makers greedy math *1200	0 / 0	4
	6289	P645C Enduring Exodus binary search two pointers *1600	0 / 0	5
	6288	P645D Robot Rapping Results Report binary search dp graphs *1800	0 / 0	6
	6287	P645E Intellectual Inquiry dp greedy strings *2200	0 / 0	8
	6286	P645F Cowslip Collections combinatorics math number theory *2500	0 / 0	9
	6285	P645G Armistice Area Apportionment binary search geometry *3200	0 / 0	10
	6284	P650A Watchmen data structures geometry math *1400	0 / 0	4
	6283	P650B Image Preview binary search brute force dp two pointers *1900	0 / 0	6
	6282	P650C Table Compression dfs and similar dp dsu graphs greedy *2200	0 / 0	8
	6281	P650D Zip-line binary search data structures dp hashing *2600	0 / 0	10
	6280	P650E Clockwork Bomb data structures dfs and similar dsu greedy trees *3200	0 / 0	10
	6279	P651A Joysticks dp greedy implementation math *1100	0 / 0	3
	6278	P651B Beautiful Paintings greedy sortings *1200	0 / 0	4
	6277	P652A Gabriel and Caterpillar implementation math *1400	0 / 0	4
	6276	P652B z-sort sortings *1000	0 / 0	3
	6275	P652C Foe Pairs combinatorics sortings two pointers *1800	0 / 0	6
	6274	P652D Nested Segments data structures sortings *1800	0 / 0	6
	6273	P652E Pursuit For Artifacts dfs and similar dsu graphs trees *2300	0 / 0	8
	6272	P652F Ants on a Circle constructive algorithms math *2800	0 / 0	10
	6271	P653A Bear and Three Balls brute force implementation sortings *900	0 / 0	3
	6270	P653B Bear and Compressing brute force dfs and similar dp strings *1300	0 / 0	4
	6269	P653C Bear and Up-Down brute force implementation *1900	0 / 0	6
	6268	P653D Delivery Bears binary search flows graphs *2200	0 / 0	8
	6267	P653E Bear and Forgotten Tree 2 dfs and similar dsu graphs trees *2400	0 / 0	9
	6266	P653F Paper task data structures string suffix structures strings *2600	0 / 0	10
	6265	P653G Move by Prime combinatorics math number theory *3100	0 / 0	10
	6264	P656A Da Vinci Powers special problem 1900	0 / 0	6
	6263	P656B Scrambled special problem implementation 1700	0 / 0	5
	6262	P656C Without Text special problem 2000	0 / 0	7
	6261	P656D Rosetta Problem special problem 2100	0 / 0	7
	6260	P656E Out of Controls special problem 2000	0 / 0	7
	6259	P656F Ace It! special problem 1900	0 / 0	6
	6258	P656G You're a Professional special problem 1900	0 / 0	6
	6257	P658A Bear and Reverse Radewoosh implementation *800	0 / 0	3
	6256	P659A Round House implementation math *1000	0 / 0	3
	6255	P659B Qualifying Contest constructive algorithms sortings *1300	0 / 0	4
	6254	P659C Tanya and Toys greedy implementation *1200	0 / 0	4
	6253	P659D Bicycle Race geometry implementation math *1500	0 / 0	5
	6252	P659E New Reform data structures dfs and similar dsu graphs greedy *1600	0 / 0	5
	6251	P659F Polycarp and Hay dfs and similar dsu graphs greedy sortings *2000	0 / 0	7
	6250	P659G Fence Divercity combinatorics dp number theory *2300	0 / 0	8
	6249	P660A Co-prime Array greedy implementation math number theory *1200	0 / 0	4
	6248	P660B Seating On Bus implementation *1000	0 / 0	3
	6247	P660C Hard Process binary search dp two pointers *1600	0 / 0	5
	6246	P660D Number of Parallelograms geometry *1900	0 / 0	6
	6245	P660E Different Subsets For All Tuples combinatorics math *2300	0 / 0	8
	6244	P660F Bear and Bowling 4 binary search data structures divide and conquer geometry ternary search *2500	0 / 0	9
	6243	P661A Lazy Caterer Sequence special problem 1300	0 / 0	4
	6242	P661B Seasons special problem 1900	0 / 0	6
	6241	P661C Array Sum special problem 2000	0 / 0	7
	6240	P661D Maximal Difference special problem 2100	0 / 0	7

Pick a problem randomly based on the current filter.