Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1256	codeforces#P1676G White-Black Balanced Subtrees dfs and similar dp graphs trees *1300	0 / 0	4
	1255	codeforces#P1676H1 Maximum Crossings (Easy Version) brute force *1400	0 / 0	4
	1254	codeforces#P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	5
	1253	codeforces#P1677A Tokitsukaze and Strange Inequality brute force data structures dp *1600	0 / 0	5
	1252	codeforces#P1677B Tokitsukaze and Meeting data structures implementation math *1700	0 / 0	5
	1251	codeforces#P1677C Tokitsukaze and Two Colorful Tapes constructive algorithms dfs and similar graphs greedy *1900	0 / 0	6
	1250	codeforces#P1677D Tokitsukaze and Permutations dp math *2500	0 / 0	9
	1249	codeforces#P1677E Tokitsukaze and Beautiful Subsegments data structures *2900	0 / 0	10
	1248	codeforces#P1677F Tokitsukaze and Gems dp math *3500	0 / 0	10
	1247	codeforces#P1678A Tokitsukaze and All Zero Sequence implementation *800	0 / 0	3
	1246	codeforces#P1678B1 Tokitsukaze and Good 01-String (easy version) implementation *800	0 / 0	3
	1245	codeforces#P1678B2 Tokitsukaze and Good 01-String (hard version) dp greedy implementation *1800	0 / 0	6
	1244	codeforces#P1679A AvtoBus brute force greedy math number theory *900	0 / 0	3
	1243	codeforces#P1679B Stone Age Problem data structures implementation *1200	0 / 0	4
	1242	codeforces#P1679C Rooks Defenders data structures implementation *1400	0 / 0	4
	1241	codeforces#P1679D Toss a Coin to Your Graph... binary search dfs and similar dp graphs *1900	0 / 0	6
	1240	codeforces#P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	1239	codeforces#P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	10
	1238	codeforces#P1680A Minimums and Maximums brute force math *800	0 / 0	3
	1237	codeforces#P1680B Robots implementation *800	0 / 0	3
	1236	codeforces#P1680C Binary String binary search greedy strings two pointers *1600	0 / 0	5
	1235	codeforces#P1680D Dog Walking brute force greedy math *2400	0 / 0	9
	1234	codeforces#P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1233	codeforces#P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	10
	1232	codeforces#P1681A Game with Cards games greedy *800	0 / 0	3
	1231	codeforces#P1681B Card Trick implementation math *800	0 / 0	3
	1230	codeforces#P1681C Double Sort implementation sortings *1200	0 / 0	4
	1229	codeforces#P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	1228	codeforces#P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	1227	codeforces#P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1226	codeforces#P1682A Palindromic Indices greedy strings *800	0 / 0	3
	1225	codeforces#P1682B AND Sorting bitmasks constructive algorithms sortings *1100	0 / 0	3
	1224	codeforces#P1682C LIS or Reverse LIS? constructive algorithms greedy implementation math *1400	0 / 0	4
	1223	codeforces#P1682D Circular Spanning Tree constructive algorithms implementation trees *2000	0 / 0	7
	1222	codeforces#P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	1221	codeforces#P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1220	codeforces#P1684A Digit Minimization constructive algorithms games math strings *800	0 / 0	3
	1219	codeforces#P1684B Z mod X = C constructive algorithms math *800	0 / 0	3
	1218	codeforces#P1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	4
	1217	codeforces#P1684D Traps constructive algorithms greedy sortings *1700	0 / 0	5
	1216	codeforces#P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1215	codeforces#P1684F Diverse Segments data structures two pointers *2600	0 / 0	10
	1214	codeforces#P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	1213	codeforces#P1684H Hard Cut constructive algorithms dfs and similar divide and conquer math *3400	0 / 0	10
	1212	codeforces#P1685A Circular Local MiniMax constructive algorithms greedy sortings *1100	0 / 0	3
	1211	codeforces#P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1210	codeforces#P1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	10
	1209	codeforces#P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	10
	1208	codeforces#P1685D2 Permutation Weight (Hard Version) constructive algorithms greedy *3500	0 / 0	10
	1207	codeforces#P1685E The Ultimate LIS Problem data structures greedy *3500	0 / 0	10
	1206	codeforces#P1686A Everything Everywhere All But One greedy *800	0 / 0	3
	1205	codeforces#P1686B Odd Subarrays dp greedy *800	0 / 0	3
	1204	codeforces#P1687A The Enchanted Forest brute force greedy *1600	0 / 0	5
	1203	codeforces#P1687B Railway System constructive algorithms graphs greedy interactive sortings *1700	0 / 0	5
	1202	codeforces#P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	9
	1201	codeforces#P1687D Cute number binary search brute force data structures dsu implementation math *2900	0 / 0	10
	1200	codeforces#P1687E Become Big For Me combinatorics constructive algorithms greedy math number theory *3500	0 / 0	10
	1199	codeforces#P1687F Koishi's Unconscious Permutation fft math *3500	0 / 0	10
	1198	codeforces#P1688A Cirno's Perfect Bitmasks Classroom bitmasks brute force *800	0 / 0	3
	1197	codeforces#P1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	3
	1196	codeforces#P1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	5
	1195	codeforces#P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	3
	1194	codeforces#P1689B Mystic Permutation data structures greedy *900	0 / 0	3
	1193	codeforces#P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	1192	codeforces#P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	1191	codeforces#P1689E ANDfinity bitmasks brute force constructive algorithms dfs and similar dsu graphs *2500	0 / 0	9
	1190	codeforces#P1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	3
	1189	codeforces#P1690B Array Decrements greedy implementation *800	0 / 0	3
	1188	codeforces#P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	3
	1187	codeforces#P1690D Black and White Stripe implementation two pointers *1000	0 / 0	3
	1186	codeforces#P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	5
	1185	codeforces#P1690F Shifting String graphs math number theory strings *1700	0 / 0	5
	1184	codeforces#P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1183	codeforces#P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	1182	codeforces#P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	3
	1181	codeforces#P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1180	codeforces#P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	6
	1179	codeforces#P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1178	codeforces#P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	1177	codeforces#P1692A Marathon implementation *800	0 / 0	3
	1176	codeforces#P1692B All Distinct greedy sortings *800	0 / 0	3
	1175	codeforces#P1692C Where's the Bishop? implementation *800	0 / 0	3
	1174	codeforces#P1692D The Clock brute force implementation *1100	0 / 0	3
	1173	codeforces#P1692E Binary Deque binary search implementation two pointers *1200	0 / 0	4
	1172	codeforces#P1692F 3SUM brute force math *1300	0 / 0	4
	1171	codeforces#P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	1170	codeforces#P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	1169	codeforces#P1693A Directional Increase greedy *1300	0 / 0	4
	1168	codeforces#P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1167	codeforces#P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1166	codeforces#P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1165	codeforces#P1693E Outermost Maximums data structures greedy *3400	0 / 0	10
	1164	codeforces#P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	10
	1163	codeforces#P1694A Creep greedy implementation *800	0 / 0	3
	1162	codeforces#P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	4
	1161	codeforces#P1695A Subrectangle Guess games *800	0 / 0	3
	1160	codeforces#P1695B Circle Game games greedy *1000	0 / 0	3
	1159	codeforces#P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1158	codeforces#P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1157	codeforces#P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8

Pick a problem randomly based on the current filter.