Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2884	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	10
	2883	P1366G Construct the String data structures dp strings *2700	0 / 0	10
	2882	P1367A Short Substrings implementation strings *800	0 / 0	3
	2881	P1367B Even Array greedy math *800	0 / 0	3
	2880	P1367C Social Distance constructive algorithms greedy math *1300	0 / 0	4
	2879	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	6
	2878	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	6
	2877	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	2876	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	2875	P1368A C+= brute force greedy implementation math *800	0 / 0	3
	2874	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	5
	2873	P1368C Even Picture constructive algorithms *1500	0 / 0	5
	2872	P1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	5
	2871	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	9
	2870	P1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	10
	2869	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	10
	2868	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	10
	2867	P1368H2 Breadboard Capacity (hard version) *3500	0 / 0	10
	2866	P1369A FashionabLee geometry math *800	0 / 0	3
	2865	P1369B AccurateLee greedy implementation strings *1200	0 / 0	4
	2864	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	4
	2863	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	6
	2862	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	9
	2861	P1369F BareLee dfs and similar dp games *2700	0 / 0	10
	2860	P1370A Maximum GCD greedy implementation math number theory *800	0 / 0	3
	2859	P1370B GCD Compression constructive algorithms math number theory *1100	0 / 0	3
	2858	P1370C Number Game games math number theory *1400	0 / 0	4
	2857	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	7
	2856	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	7
	2855	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	9
	2854	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	10
	2853	P1371A Magical Sticks math *800	0 / 0	3
	2852	P1371B Magical Calendar math *1200	0 / 0	4
	2851	P1371C A Cookie for You greedy implementation math *1300	0 / 0	4
	2850	P1371D Grid-00100 constructive algorithms greedy implementation *1600	0 / 0	5
	2849	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	6
	2848	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	2847	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	10
	2846	P1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	3
	2845	P1372B Omkar and Last Class of Math greedy math number theory *1300	0 / 0	4
	2844	P1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	5
	2843	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	7
	2842	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	10
	2841	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	10
	2840	P1373A Donut Shops greedy implementation math *1000	0 / 0	3
	2839	P1373B 01 Game games *900	0 / 0	3
	2838	P1373C Pluses and Minuses math *1300	0 / 0	4
	2837	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	5
	2836	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	8
	2835	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	9
	2834	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	10
	2833	P1374A Required Remainder math *800	0 / 0	3
	2832	P1374B Multiply by 2, divide by 6 math *900	0 / 0	3
	2831	P1374C Move Brackets greedy strings *1000	0 / 0	3
	2830	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	4
	2829	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	5
	2828	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	9
	2827	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	9
	2826	P1375A Sign Flipping constructive algorithms math *1100	0 / 0	3
	2825	P1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	4
	2824	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	4
	2823	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	6
	2822	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	9
	2821	P1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	10
	2820	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	10
	2819	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	10
	2818	P1375I Cubic Lattice geometry math matrices number theory *3500	0 / 0	10
	2817	P1379A Acacius and String brute force implementation strings *1500	0 / 0	5
	2816	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	5
	2815	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	2814	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	2813	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	10
	2812	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	10
	2811	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	10
	2810	P1380A Three Indices brute force data structures *900	0 / 0	3
	2809	P1380B Universal Solution greedy *1400	0 / 0	4
	2808	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	4
	2807	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	2806	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	2805	P1380F Strange Addition data structures dp matrices *2600	0 / 0	10
	2804	P1380G Circular Dungeon greedy math probabilities *2600	0 / 0	10
	2803	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	4
	2802	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	2801	P1381B Unmerge dp *1800	0 / 0	6
	2800	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	2799	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	2798	P1381E Origami geometry math sortings *3300	0 / 0	10
	2797	P1382A Common Subsequence brute force *800	0 / 0	3
	2796	P1382B Sequential Nim dp games *1100	0 / 0	3
	2795	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	2794	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	6
	2793	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	10
	2792	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	10
	2791	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	10
	2790	P1383F Special Edges flows graphs *3200	0 / 0	10
	2789	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	4
	2788	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	6
	2787	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	8
	2786	P1385A Three Pairwise Maximums math *800	0 / 0	3
	2785	P1385B Restore the Permutation by Merger greedy *800	0 / 0	3

Pick a problem randomly based on the current filter.