Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2856	codeforces#P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	2855	codeforces#P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	2854	codeforces#P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	2853	codeforces#P1371A Magical Sticks math *800	0 / 0	3
	2852	codeforces#P1371B Magical Calendar math *1200	0 / 0	4
	2851	codeforces#P1371C A Cookie for You greedy implementation math *1300	0 / 0	4
	2850	codeforces#P1371D Grid-00100 constructive algorithms greedy implementation *1600	0 / 0	5
	2849	codeforces#P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	2848	codeforces#P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	2847	codeforces#P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	2846	codeforces#P1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	3
	2845	codeforces#P1372B Omkar and Last Class of Math greedy math number theory *1300	0 / 0	4
	2844	codeforces#P1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	5
	2843	codeforces#P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	2842	codeforces#P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	10
	2841	codeforces#P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	10
	2840	codeforces#P1373A Donut Shops greedy implementation math *1000	0 / 0	3
	2839	codeforces#P1373B 01 Game games *900	0 / 0	3
	2838	codeforces#P1373C Pluses and Minuses math *1300	0 / 0	4
	2837	codeforces#P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	5
	2836	codeforces#P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8
	2835	codeforces#P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	9
	2834	codeforces#P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	10
	2833	codeforces#P1374A Required Remainder math *800	0 / 0	3
	2832	codeforces#P1374B Multiply by 2, divide by 6 math *900	0 / 0	3
	2831	codeforces#P1374C Move Brackets greedy strings *1000	0 / 0	3
	2830	codeforces#P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	4
	2829	codeforces#P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	5
	2828	codeforces#P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	9
	2827	codeforces#P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	9
	2826	codeforces#P1375A Sign Flipping constructive algorithms math *1100	0 / 0	3
	2825	codeforces#P1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	4
	2824	codeforces#P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	4
	2823	codeforces#P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	6
	2822	codeforces#P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	9
	2821	codeforces#P1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	10
	2820	codeforces#P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	2819	codeforces#P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	10
	2818	codeforces#P1375I Cubic Lattice geometry math matrices number theory *3500	0 / 0	10
	2817	codeforces#P1379A Acacius and String brute force implementation strings *1500	0 / 0	5
	2816	codeforces#P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	5
	2815	codeforces#P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	2814	codeforces#P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	2813	codeforces#P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	2812	codeforces#P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	10
	2811	codeforces#P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	10
	2810	codeforces#P1380A Three Indices brute force data structures *900	0 / 0	3
	2809	codeforces#P1380B Universal Solution greedy *1400	0 / 0	4
	2808	codeforces#P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	2807	codeforces#P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	2806	codeforces#P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	2805	codeforces#P1380F Strange Addition data structures dp matrices *2600	0 / 0	10
	2804	codeforces#P1380G Circular Dungeon greedy math probabilities *2600	0 / 0	10
	2803	codeforces#P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	4
	2802	codeforces#P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	2801	codeforces#P1381B Unmerge dp *1800	0 / 0	6
	2800	codeforces#P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	2799	codeforces#P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	2798	codeforces#P1381E Origami geometry math sortings *3300	0 / 0	10
	2797	codeforces#P1382A Common Subsequence brute force *800	0 / 0	3
	2796	codeforces#P1382B Sequential Nim dp games *1100	0 / 0	3
	2795	codeforces#P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	2794	codeforces#P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	2793	codeforces#P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	2792	codeforces#P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	2791	codeforces#P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	2790	codeforces#P1383F Special Edges flows graphs *3200	0 / 0	10
	2789	codeforces#P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	4
	2788	codeforces#P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	2787	codeforces#P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	8
	2786	codeforces#P1385A Three Pairwise Maximums math *800	0 / 0	3
	2785	codeforces#P1385B Restore the Permutation by Merger greedy *800	0 / 0	3
	2784	codeforces#P1385C Make It Good greedy *1200	0 / 0	4
	2783	codeforces#P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	5
	2782	codeforces#P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	7
	2781	codeforces#P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	2780	codeforces#P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	8
	2779	codeforces#P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	10
	2778	codeforces#P1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	10
	2777	codeforces#P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	10
	2776	codeforces#P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	7
	2775	codeforces#P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	7
	2774	codeforces#P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	9
	2773	codeforces#P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	10
	2772	codeforces#P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	3
	2771	codeforces#P1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	3
	2770	codeforces#P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	6
	2769	codeforces#P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	7
	2768	codeforces#P1388E Uncle Bogdan and Projections data structures geometry sortings *2700	0 / 0	10
	2767	codeforces#P1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	3
	2766	codeforces#P1389B Array Walk brute force dp greedy *1600	0 / 0	5
	2765	codeforces#P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	2764	codeforces#P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	7
	2763	codeforces#P1389E Calendar Ambiguity math number theory *2200	0 / 0	8
	2762	codeforces#P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	10
	2761	codeforces#P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	10
	2760	codeforces#P1391A Suborrays constructive algorithms math *800	0 / 0	3
	2759	codeforces#P1391B Fix You brute force greedy implementation *800	0 / 0	3
	2758	codeforces#P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	5
	2757	codeforces#P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	7

Pick a problem randomly based on the current filter.