Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2684	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	2683	P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	5
	2682	P1406D Three Sequences constructive algorithms data structures greedy math *2200	0 / 0	8
	2681	P1406E Deleting Numbers interactive math number theory *2600	0 / 0	10
	2680	P1407A Ahahahahahahahaha constructive algorithms math *1100	0 / 0	3
	2679	P1407B Big Vova brute force greedy math number theory *1300	0 / 0	4
	2678	P1407C Chocolate Bunny constructive algorithms interactive math two pointers *1600	0 / 0	5
	2677	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	8
	2676	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2675	P1408A Circle Coloring constructive algorithms *800	0 / 0	3
	2674	P1408B Arrays Sum constructive algorithms greedy math *1400	0 / 0	4
	2673	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	2672	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2671	P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9
	2670	P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	8
	2669	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2668	P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	10
	2667	P1408I Bitwise Magic dp math *3200	0 / 0	10
	2666	P1409A Yet Another Two Integers Problem greedy math *800	0 / 0	3
	2665	P1409B Minimum Product brute force greedy math *1100	0 / 0	3
	2664	P1409C Yet Another Array Restoration brute force math number theory *1200	0 / 0	4
	2663	P1409D Decrease the Sum of Digits greedy math *1500	0 / 0	5
	2662	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2661	P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2660	P1411A In-game Chat implementation *800	0 / 0	3
	2659	P1411B Fair Numbers brute force number theory *1000	0 / 0	3
	2658	P1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	5
	2657	P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7
	2656	P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	8
	2655	P1411F The Thorny Path greedy math *3000	0 / 0	10
	2654	P1411G No Game No Life bitmasks games math matrices *2700	0 / 0	10
	2653	P1413A Finding Sasuke constructive algorithms math *800	0 / 0	3
	2652	P1413B A New Technique implementation *1100	0 / 0	3
	2651	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	2650	P1413D Shurikens data structures greedy implementation *1700	0 / 0	5
	2649	P1413E Solo mid Oracle greedy math ternary search *2100	0 / 0	7
	2648	P1413F Roads and Ramen data structures trees *2800	0 / 0	10
	2647	P1415A Prison Break brute force math *800	0 / 0	3
	2646	P1415B Repainting Street brute force brute force greedy *1100	0 / 0	3
	2645	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	4
	2644	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	7
	2643	P1415E New Game Plus! constructive algorithms greedy math *2200	0 / 0	8
	2642	P1415F Cakes for Clones dp *2900	0 / 0	10
	2641	P1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	5
	2640	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	7
	2639	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	2638	P1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	10
	2637	P1416E Split binary search data structures dp greedy *3200	0 / 0	10
	2636	P1416F Showing Off flows graph matchings greedy implementation *3300	0 / 0	10
	2635	P1417A Copy-paste greedy math *800	0 / 0	3
	2634	P1417B Two Arrays greedy math sortings *1100	0 / 0	3
	2633	P1418A Buying Torches math *1000	0 / 0	3
	2632	P1418B Negative Prefixes greedy sortings *1300	0 / 0	4
	2631	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	5
	2630	P1418D Trash Problem data structures implementation *2100	0 / 0	7
	2629	P1418E Expected Damage binary search combinatorics probabilities *2400	0 / 0	9
	2628	P1418F Equal Product data structures math number theory two pointers *3000	0 / 0	10
	2627	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	2626	P1419A Digit Game games greedy implementation *900	0 / 0	3
	2625	P1419B Stairs brute force constructive algorithms greedy implementation math *1200	0 / 0	4
	2624	P1419C Killjoy greedy implementation math *1500	0 / 0	5
	2623	P1419D1 Sage's Birthday (easy version) binary search constructive algorithms greedy sortings *1000	0 / 0	3
	2622	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	2621	P1419E Decryption constructive algorithms implementation math number theory *2100	0 / 0	7
	2620	P1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	10
	2619	P1420A Cubes Sorting math sortings *900	0 / 0	3
	2618	P1420B Rock and Lever bitmasks math *1200	0 / 0	4
	2617	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	2616	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	2615	P1420D Rescue Nibel! combinatorics data structures sortings *1800	0 / 0	6
	2614	P1420E Battle Lemmings dp greedy *2500	0 / 0	9
	2613	P1421A XORwice bitmasks greedy math *800	0 / 0	3
	2612	P1421B Putting Bricks in the Wall constructive algorithms implementation *1100	0 / 0	3
	2611	P1421C Palindromifier constructive algorithms strings *1400	0 / 0	4
	2610	P1421D Hexagons brute force constructive algorithms greedy implementation math shortest paths *1900	0 / 0	6
	2609	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	10
	2608	P1422A Fence geometry math *800	0 / 0	3
	2607	P1422B Nice Matrix greedy implementation math *1300	0 / 0	4
	2606	P1422C Bargain combinatorics dp math *1700	0 / 0	5
	2605	P1422D Returning Home graphs shortest paths sortings *2300	0 / 0	8
	2604	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	10
	2603	P1422F Boring Queries data structures math number theory *2700	0 / 0	10
	2602	P1423A Wakanda Forever *3500	0 / 0	10
	2601	P1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	6
	2600	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	10
	2599	P1423D Does anyone else hate the wind? *3100	0 / 0	10
	2598	P1423E 5G Antenna Towers geometry *2700	0 / 0	10
	2597	P1423F Coins math *2700	0 / 0	10
	2596	P1423G Growing flowers data structures *3500	0 / 0	10
	2595	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	9
	2594	P1423I Lookup Tables bitmasks *3000	0 / 0	10
	2593	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	9
	2592	P1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	5
	2591	P1423L Light switches meet-in-the-middle *2600	0 / 0	10
	2590	P1423M Milutin's Plums interactive *2800	0 / 0	10
	2589	P1423N BubbleSquare Tokens *3500	0 / 0	10
	2588	P1424G Years data structures sortings *1300	0 / 0	4
	2587	P1424M Ancient Language graphs sortings *2200	0 / 0	8
	2586	P1425A Arena of Greed games greedy *1400	0 / 0	4
	2585	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	10

Pick a problem randomly based on the current filter.