Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2356	codeforces#P1473A Replacing Elements greedy implementation math sortings *800	0 / 0	3
	2355	codeforces#P1473B String LCM brute force math number theory strings *1000	0 / 0	3
	2354	codeforces#P1473C No More Inversions constructive algorithms math *1500	0 / 0	5
	2353	codeforces#P1473D Program data structures dp implementation strings *1700	0 / 0	5
	2352	codeforces#P1473E Minimum Path graphs shortest paths *2400	0 / 0	9
	2351	codeforces#P1473F Strange Set flows math *2700	0 / 0	10
	2350	codeforces#P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	2349	codeforces#P1474A Puzzle From the Future greedy *800	0 / 0	3
	2348	codeforces#P1474B Different Divisors binary search constructive algorithms greedy math number theory *1000	0 / 0	3
	2347	codeforces#P1474C Array Destruction brute force constructive algorithms data structures greedy implementation sortings *1700	0 / 0	5
	2346	codeforces#P1474D Cleaning data structures dp greedy math *2200	0 / 0	8
	2345	codeforces#P1474E What Is It? constructive algorithms greedy *2500	0 / 0	9
	2344	codeforces#P1474F 1 2 3 4 ... dp math matrices *3000	0 / 0	10
	2343	codeforces#P1475A Odd Divisor math number theory *900	0 / 0	3
	2342	codeforces#P1475B New Year's Number brute force dp math *900	0 / 0	3
	2341	codeforces#P1475C Ball in Berland combinatorics graphs math *1400	0 / 0	4
	2340	codeforces#P1475D Cleaning the Phone binary search dp sortings two pointers *1800	0 / 0	6
	2339	codeforces#P1475E Advertising Agency combinatorics math sortings *1600	0 / 0	5
	2338	codeforces#P1475F Unusual Matrix 2-sat brute force constructive algorithms *1900	0 / 0	6
	2337	codeforces#P1475G Strange Beauty dp math number theory sortings *1900	0 / 0	6
	2336	codeforces#P1476A K-divisible Sum binary search constructive algorithms greedy math *1000	0 / 0	3
	2335	codeforces#P1476B Inflation binary search brute force greedy math *1300	0 / 0	4
	2334	codeforces#P1476C Longest Simple Cycle dp graphs greedy *1600	0 / 0	5
	2333	codeforces#P1476D Journey dfs and similar dp dsu implementation *1700	0 / 0	5
	2332	codeforces#P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2331	codeforces#P1476F Lanterns binary search data structures dp *3000	0 / 0	10
	2330	codeforces#P1476G Minimum Difference data structures hashing sortings two pointers *3100	0 / 0	10
	2329	codeforces#P1477A Nezzar and Board constructive algorithms math number theory *1800	0 / 0	6
	2328	codeforces#P1477B Nezzar and Binary String data structures greedy *1900	0 / 0	6
	2327	codeforces#P1477C Nezzar and Nice Beatmap constructive algorithms geometry greedy math sortings *2200	0 / 0	8
	2326	codeforces#P1477D Nezzar and Hidden Permutations constructive algorithms dfs and similar graphs *2800	0 / 0	10
	2325	codeforces#P1477E Nezzar and Tournaments data structures greedy *3300	0 / 0	10
	2324	codeforces#P1477F Nezzar and Chocolate Bars combinatorics fft math probabilities *3500	0 / 0	10
	2323	codeforces#P1478A Nezzar and Colorful Balls brute force greedy *800	0 / 0	3
	2322	codeforces#P1478B Nezzar and Lucky Number brute force dp greedy math *1100	0 / 0	3
	2321	codeforces#P1478C Nezzar and Symmetric Array implementation math sortings *1700	0 / 0	5
	2320	codeforces#P1479A Searching Local Minimum binary search interactive ternary search *1700	0 / 0	5
	2319	codeforces#P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	6
	2318	codeforces#P1479B2 Painting the Array II constructive algorithms data structures dp greedy implementation *2100	0 / 0	7
	2317	codeforces#P1479C Continuous City bitmasks constructive algorithms *2500	0 / 0	9
	2316	codeforces#P1479D Odd Mineral Resource binary search bitmasks brute force data structures probabilities trees *2900	0 / 0	10
	2315	codeforces#P1479E School Clubs dp fft math number theory probabilities *3500	0 / 0	10
	2314	codeforces#P1480A Yet Another String Game games greedy strings *800	0 / 0	3
	2313	codeforces#P1480B The Great Hero greedy implementation sortings *900	0 / 0	3
	2312	codeforces#P1481A Space Navigation greedy strings *800	0 / 0	3
	2311	codeforces#P1481B New Colony brute force greedy implementation *1100	0 / 0	3
	2310	codeforces#P1481C Fence Painting brute force constructive algorithms greedy *1600	0 / 0	5
	2309	codeforces#P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	7
	2308	codeforces#P1481E Sorting Books data structures dp greedy *2500	0 / 0	9
	2307	codeforces#P1481F AB Tree dp greedy trees *3100	0 / 0	10
	2306	codeforces#P1482A Prison Break math *800	0 / 0	3
	2305	codeforces#P1482B Restore Modulo implementation math *1500	0 / 0	5
	2304	codeforces#P1482C Basic Diplomacy brute force constructive algorithms greedy implementation *1600	0 / 0	5
	2303	codeforces#P1482D Playlist data structures dsu implementation shortest paths *1900	0 / 0	6
	2302	codeforces#P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	2301	codeforces#P1482F Useful Edges graphs shortest paths *2400	0 / 0	9
	2300	codeforces#P1482G Vabank binary search interactive *3200	0 / 0	10
	2299	codeforces#P1482H Exam data structures string suffix structures trees *3400	0 / 0	10
	2298	codeforces#P1485A Add and Divide brute force greedy math number theory *1000	0 / 0	3
	2297	codeforces#P1485B Replace and Keep Sorted dp implementation math *1200	0 / 0	4
	2296	codeforces#P1485C Floor and Mod binary search brute force math number theory *1700	0 / 0	5
	2295	codeforces#P1485D Multiples and Power Differences constructive algorithms graphs math number theory *2200	0 / 0	8
	2294	codeforces#P1485E Move and Swap dfs and similar dp greedy trees *2500	0 / 0	9
	2293	codeforces#P1485F Copy or Prefix Sum combinatorics data structures dp sortings *2400	0 / 0	9
	2292	codeforces#P1486A Shifting Stacks greedy implementation *900	0 / 0	3
	2291	codeforces#P1486B Eastern Exhibition binary search geometry shortest paths sortings *1500	0 / 0	5
	2290	codeforces#P1486C1 Guessing the Greatest (easy version) binary search interactive *1600	0 / 0	5
	2289	codeforces#P1486C2 Guessing the Greatest (hard version) binary search interactive *1900	0 / 0	6
	2288	codeforces#P1486D Max Median binary search data structures dp *2100	0 / 0	7
	2287	codeforces#P1486E Paired Payment binary search brute force constructive algorithms dp flows graphs shortest paths *2200	0 / 0	8
	2286	codeforces#P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	10
	2285	codeforces#P1487A Arena implementation sortings *800	0 / 0	3
	2284	codeforces#P1487B Cat Cycle math number theory *1200	0 / 0	4
	2283	codeforces#P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	5
	2282	codeforces#P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	5
	2281	codeforces#P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2280	codeforces#P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2279	codeforces#P1487G String Counting combinatorics dp fft math *2700	0 / 0	10
	2278	codeforces#P1488A From Zero To Y special problem math 900	0 / 0	3
	2277	codeforces#P1488B RBS Deletion special problem greedy 1800	0 / 0	6
	2276	codeforces#P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	6
	2275	codeforces#P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	2274	codeforces#P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2273	codeforces#P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	2272	codeforces#P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	9
	2271	codeforces#P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	10
	2270	codeforces#P1488I Demonic Invasion special problem flows 3100	0 / 0	10
	2269	codeforces#P1488J Flower Shop special problem data structures fft math 3100	0 / 0	10
	2268	codeforces#P1490A Dense Array greedy math *800	0 / 0	3
	2267	codeforces#P1490B Balanced Remainders brute force constructive algorithms math *1000	0 / 0	3
	2266	codeforces#P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	3
	2265	codeforces#P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	4
	2264	codeforces#P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2263	codeforces#P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2262	codeforces#P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	6
	2261	codeforces#P1491A K-th Largest Value brute force greedy implementation *800	0 / 0	3
	2260	codeforces#P1491B Minimal Cost brute force math *1200	0 / 0	4
	2259	codeforces#P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2258	codeforces#P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2257	codeforces#P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	9

Pick a problem randomly based on the current filter.