Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2756	codeforces#P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	10
	2755	codeforces#P1392A Omkar and Password greedy math *800	0 / 0	3
	2754	codeforces#P1392B Omkar and Infinity Clock implementation math *800	0 / 0	3
	2753	codeforces#P1392C Omkar and Waterslide greedy implementation *1200	0 / 0	4
	2752	codeforces#P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	5
	2751	codeforces#P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	7
	2750	codeforces#P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	9
	2749	codeforces#P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	10
	2748	codeforces#P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	10
	2747	codeforces#P1392I Kevin and Grid fft graphs math *3300	0 / 0	10
	2746	codeforces#P1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	3
	2745	codeforces#P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	4
	2744	codeforces#P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	5
	2743	codeforces#P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	7
	2742	codeforces#P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	10
	2741	codeforces#P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	2740	codeforces#P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	2739	codeforces#P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	2738	codeforces#P1394C Boboniu and String binary search geometry ternary search *2600	0 / 0	10
	2737	codeforces#P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	10
	2736	codeforces#P1394E Boboniu and Banknote Collection strings *3500	0 / 0	10
	2735	codeforces#P1395A Boboniu Likes to Color Balls brute force math *1000	0 / 0	3
	2734	codeforces#P1395B Boboniu Plays Chess constructive algorithms *1100	0 / 0	3
	2733	codeforces#P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	5
	2732	codeforces#P1396A Multiples of Length constructive algorithms greedy number theory *1600	0 / 0	5
	2731	codeforces#P1396B Stoned Game brute force constructive algorithms games greedy *1800	0 / 0	6
	2730	codeforces#P1396C Monster Invaders dp greedy implementation *2300	0 / 0	8
	2729	codeforces#P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	10
	2728	codeforces#P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	10
	2727	codeforces#P1397A Juggling Letters greedy strings *800	0 / 0	3
	2726	codeforces#P1397B Power Sequence brute force math number theory sortings *1500	0 / 0	5
	2725	codeforces#P1398A Bad Triangle geometry math *800	0 / 0	3
	2724	codeforces#P1398B Substring Removal Game games greedy sortings *800	0 / 0	3
	2723	codeforces#P1398C Good Subarrays data structures dp math *1600	0 / 0	5
	2722	codeforces#P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	6
	2721	codeforces#P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	8
	2720	codeforces#P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	2719	codeforces#P1398G Running Competition bitmasks fft math number theory *2600	0 / 0	10
	2718	codeforces#P1399A Remove Smallest greedy sortings *800	0 / 0	3
	2717	codeforces#P1399B Gifts Fixing greedy *800	0 / 0	3
	2716	codeforces#P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	4
	2715	codeforces#P1399D Binary String To Subsequences constructive algorithms data structures greedy implementation *1500	0 / 0	5
	2714	codeforces#P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	7
	2713	codeforces#P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	2712	codeforces#P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	2711	codeforces#P1400A String Similarity constructive algorithms strings *800	0 / 0	3
	2710	codeforces#P1400B RPG Protagonist brute force greedy math *1700	0 / 0	5
	2709	codeforces#P1400C Binary String Reconstruction 2-sat brute force constructive algorithms greedy *1500	0 / 0	5
	2708	codeforces#P1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	6
	2707	codeforces#P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	8
	2706	codeforces#P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	10
	2705	codeforces#P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	2704	codeforces#P1401A Distance and Axis constructive algorithms math *900	0 / 0	3
	2703	codeforces#P1401B Ternary Sequence constructive algorithms greedy math *1100	0 / 0	3
	2702	codeforces#P1401C Mere Array constructive algorithms math number theory sortings *1300	0 / 0	4
	2701	codeforces#P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	6
	2700	codeforces#P1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	9
	2699	codeforces#P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	9
	2698	codeforces#P1402A Fancy Fence special problem data structures dsu implementation math sortings 1800	0 / 0	6
	2697	codeforces#P1402B Roads special problem geometry sortings 2900	0 / 0	10
	2696	codeforces#P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	10
	2695	codeforces#P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	2694	codeforces#P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2693	codeforces#P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	10
	2692	codeforces#P1404A Balanced Bitstring implementation strings *1500	0 / 0	5
	2691	codeforces#P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	6
	2690	codeforces#P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2689	codeforces#P1404D Game of Pairs constructive algorithms dfs and similar interactive math number theory *2800	0 / 0	10
	2688	codeforces#P1404E Bricks flows graph matchings graphs *2800	0 / 0	10
	2687	codeforces#P1405A Permutation Forgery constructive algorithms *800	0 / 0	3
	2686	codeforces#P1405B Array Cancellation constructive algorithms implementation *1000	0 / 0	3
	2685	codeforces#P1406A Subset Mex greedy implementation math *900	0 / 0	3
	2684	codeforces#P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	4
	2683	codeforces#P1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	5
	2682	codeforces#P1406D Three Sequences constructive algorithms data structures greedy math *2200	0 / 0	8
	2681	codeforces#P1406E Deleting Numbers interactive math number theory *2600	0 / 0	10
	2680	codeforces#P1407A Ahahahahahahahaha constructive algorithms math *1100	0 / 0	3
	2679	codeforces#P1407B Big Vova brute force greedy math number theory *1300	0 / 0	4
	2678	codeforces#P1407C Chocolate Bunny constructive algorithms interactive math two pointers *1600	0 / 0	5
	2677	codeforces#P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	8
	2676	codeforces#P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	9
	2675	codeforces#P1408A Circle Coloring constructive algorithms *800	0 / 0	3
	2674	codeforces#P1408B Arrays Sum constructive algorithms greedy math *1400	0 / 0	4
	2673	codeforces#P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	2672	codeforces#P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2671	codeforces#P1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	9
	2670	codeforces#P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	8
	2669	codeforces#P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	10
	2668	codeforces#P1408H Rainbow Triples binary search data structures flows greedy *3300	0 / 0	10
	2667	codeforces#P1408I Bitwise Magic dp math *3200	0 / 0	10
	2666	codeforces#P1409A Yet Another Two Integers Problem greedy math *800	0 / 0	3
	2665	codeforces#P1409B Minimum Product brute force greedy math *1100	0 / 0	3
	2664	codeforces#P1409C Yet Another Array Restoration brute force math number theory *1200	0 / 0	4
	2663	codeforces#P1409D Decrease the Sum of Digits greedy math *1500	0 / 0	5
	2662	codeforces#P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2661	codeforces#P1409F Subsequences of Length Two dp strings *2100	0 / 0	7
	2660	codeforces#P1411A In-game Chat implementation *800	0 / 0	3
	2659	codeforces#P1411B Fair Numbers brute force number theory *1000	0 / 0	3
	2658	codeforces#P1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	5
	2657	codeforces#P1411D Grime Zoo brute force greedy implementation strings *2100	0 / 0	7

Pick a problem randomly based on the current filter.