Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2584	P1425C Captain of Knights math *3100	0 / 0	10
	2583	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	8
	2582	P1425E Excitation of Atoms greedy implementation *2200	0 / 0	8
	2581	P1425F Flamingoes of Mystery interactive *1400	0 / 0	4
	2580	P1425H Huge Boxes of Animal Toys constructive algorithms *1300	0 / 0	4
	2579	P1425I Impressive Harvesting of The Orchard data structures *2800	0 / 0	10
	2578	P1426A Floor Number implementation math *800	0 / 0	3
	2577	P1426B Symmetric Matrix implementation *900	0 / 0	3
	2576	P1426C Increase and Copy binary search constructive algorithms math *1100	0 / 0	3
	2575	P1426D Non-zero Segments constructive algorithms data structures greedy sortings *1500	0 / 0	5
	2574	P1426E Rock, Paper, Scissors brute force constructive algorithms flows greedy math *1800	0 / 0	6
	2573	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	7
	2572	P1427A Avoiding Zero math sortings *900	0 / 0	3
	2571	P1427B Chess Cheater greedy implementation sortings *1400	0 / 0	4
	2570	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	7
	2569	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	7
	2568	P1427E Xum bitmasks constructive algorithms math matrices number theory *2500	0 / 0	9
	2567	P1427F Boring Card Game data structures greedy trees *3200	0 / 0	10
	2566	P1427G One Billion Shades of Grey flows graphs *3300	0 / 0	10
	2565	P1427H Prison Break binary search games geometry ternary search *3500	0 / 0	10
	2564	P1428A Box is Pull math *800	0 / 0	3
	2563	P1428B Belted Rooms graphs implementation *1200	0 / 0	4
	2562	P1428C ABBB brute force data structures greedy strings *1100	0 / 0	3
	2561	P1428D Bouncing Boomerangs constructive algorithms greedy implementation *1900	0 / 0	6
	2560	P1428E Carrots for Rabbits binary search data structures greedy math sortings *2200	0 / 0	8
	2559	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2558	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	10
	2557	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	10
	2556	P1428H Rotary Laser Lock binary search interactive *3500	0 / 0	10
	2555	P1430A Number of Apartments brute force constructive algorithms math *900	0 / 0	3
	2554	P1430B Barrels greedy implementation sortings *800	0 / 0	3
	2553	P1430C Numbers on Whiteboard constructive algorithms data structures greedy implementation math *1000	0 / 0	3
	2552	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	5
	2551	P1430E String Reversal data structures greedy strings *1900	0 / 0	6
	2550	P1430F Realistic Gameplay dp greedy *2600	0 / 0	10
	2549	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	10
	2548	P1431A Selling Hamburgers special problem 800	0 / 0	3
	2547	P1431B Polycarp and the Language of Gods special problem implementation two pointers 1400	0 / 0	4
	2546	P1431C Black Friday special problem implementation 1600	0 / 0	5
	2545	P1431D Used Markers special problem greedy 1500	0 / 0	5
	2544	P1431E Chess Match special problem 2000	0 / 0	7
	2543	P1431F Neural Network Problem special problem binary search greedy 2100	0 / 0	7
	2542	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	7
	2541	P1431H Rogue-like Game special problem brute force greedy two pointers 2600	0 / 0	10
	2540	P1431I Cyclic Shifts special problem strings 2900	0 / 0	10
	2539	P1431J Zero-XOR Array special problem dp 3400	0 / 0	10
	2538	P1433A Boring Apartments implementation math *800	0 / 0	3
	2537	P1433B Yet Another Bookshelf greedy implementation *800	0 / 0	3
	2536	P1433C Dominant Piranha constructive algorithms greedy *900	0 / 0	3
	2535	P1433D Districts Connection constructive algorithms dfs and similar *1200	0 / 0	4
	2534	P1433E Two Round Dances combinatorics math *1300	0 / 0	4
	2533	P1433F Zero Remainder Sum dp *2100	0 / 0	7
	2532	P1433G Reducing Delivery Cost brute force graphs shortest paths *2100	0 / 0	7
	2531	P1434E A Convex Game dsu games *3500	0 / 0	10
	2530	P1436A Reorder math *800	0 / 0	3
	2529	P1436B Prime Square constructive algorithms math *900	0 / 0	3
	2528	P1436C Binary Search binary search combinatorics *1500	0 / 0	5
	2527	P1436D Bandit in a City binary search dfs and similar graphs greedy trees *1900	0 / 0	6
	2526	P1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	9
	2525	P1436F Sum Over Subsets combinatorics math number theory *2800	0 / 0	10
	2524	P1437A Marketing Scheme brute force constructive algorithms greedy math *800	0 / 0	3
	2523	P1437B Reverse Binary Strings constructive algorithms greedy *1200	0 / 0	4
	2522	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	6
	2521	P1437D Minimal Height Tree graphs greedy shortest paths trees *1600	0 / 0	5
	2520	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	8
	2519	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	10
	2518	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	10
	2517	P1438A Specific Tastes of Andre constructive algorithms implementation *800	0 / 0	3
	2516	P1438B Valerii Against Everyone constructive algorithms data structures greedy sortings *1000	0 / 0	3
	2515	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	7
	2514	P1438D Powerful Ksenia bitmasks constructive algorithms math *2200	0 / 0	8
	2513	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	2512	P1438F Olha and Igor interactive probabilities trees *3000	0 / 0	10
	2511	P1439A1 Binary Table (Easy Version) constructive algorithms implementation *1500	0 / 0	5
	2510	P1439A2 Binary Table (Hard Version) constructive algorithms graphs greedy implementation *1900	0 / 0	6
	2509	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	10
	2508	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	2507	P1439D INOI Final Contests combinatorics dp fft *3100	0 / 0	10
	2506	P1439E Cheat and Win bitmasks data structures games trees *3500	0 / 0	10
	2505	P1440A Buy the String implementation math *800	0 / 0	3
	2504	P1440B Sum of Medians greedy math *900	0 / 0	3
	2503	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	6
	2502	P1442B Identify the Operations combinatorics data structures dsu greedy implementation *1800	0 / 0	6
	2501	P1442C Graph Transpositions dfs and similar graphs greedy shortest paths *2400	0 / 0	9
	2500	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	10
	2499	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	10
	2498	P1442F Differentiating Games games interactive *3400	0 / 0	10
	2497	P1443A Kids Seating constructive algorithms math *800	0 / 0	3
	2496	P1443B Saving the City dp greedy math sortings *1300	0 / 0	4
	2495	P1443C The Delivery Dilemma binary search greedy sortings *1400	0 / 0	4
	2494	P1443E Long Permutation brute force math two pointers *2400	0 / 0	9
	2493	P1444A Division brute force math number theory *1500	0 / 0	5
	2492	P1444B Divide and Sum combinatorics math sortings *1900	0 / 0	6
	2491	P1444C Team-Building data structures dfs and similar dsu graphs *2500	0 / 0	9
	2490	P1444D Rectangular Polyline constructive algorithms dp geometry *2900	0 / 0	10
	2489	P1444E Finding the Vertex brute force dfs and similar dp interactive trees *3500	0 / 0	10
	2488	P1445A Array Rearrangment greedy sortings *800	0 / 0	3
	2487	P1445B Elimination greedy math *900	0 / 0	3
	2486	P1446A Knapsack constructive algorithms greedy sortings *1300	0 / 0	4
	2485	P1446B Catching Cheaters dp strings *1800	0 / 0	6

Pick a problem randomly based on the current filter.