Problem Set - *2300 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	4089	P1132D Stressful Training binary search greedy *2300	0 / 0	8
	4088	P1132E Knapsack dfs and similar dp greedy *2300	0 / 0	8
	4062	P1139D Steps to One dp math number theory probabilities *2300	0 / 0	8
	4004	P1148E Earth Wind and Fire constructive algorithms greedy math sortings two pointers *2300	0 / 0	8
	3988	P1151F Sonya and Informatics combinatorics dp matrices probabilities *2300	0 / 0	8
	3956	P1156F Card Bag dp math probabilities *2300	0 / 0	8
	3909	P1167F Scalar Queries combinatorics data structures math sortings *2300	0 / 0	8
	3889	P1172C1 Nauuo and Pictures (easy version) dp probabilities *2300	0 / 0	8
	3835	P1182E Product Oriented Recurrence dp math matrices number theory *2300	0 / 0	8
	3788	P1188B Count Pairs math matrices number theory two pointers *2300	0 / 0	8
	3779	P1190C Tokitsukaze and Duel brute force games greedy *2300	0 / 0	8
	3742	P1197E Culture Code binary search combinatorics data structures dp shortest paths sortings *2300	0 / 0	8
	3737	P1198D Rectangle Painting 1 dp *2300	0 / 0	8
	3727	P1200F Graph Traveler brute force data structures dfs and similar dp graphs implementation math number theory *2300	0 / 0	8
	3707	P1203F2 Complete the Projects (hard version) dp greedy *2300	0 / 0	8
	3701	P1204E Natasha, Sasha and the Prefix Sums combinatorics dp math number theory *2300	0 / 0	8
	3654	P1211F kotlinkotlinkotlinkotlin... special problem graphs implementation strings 2300	0 / 0	8
	3617	P1217E Sum Queries? data structures greedy implementation math *2300	0 / 0	8
	3562	P1228E Another Filling the Grid combinatorics dp math *2300	0 / 0	8
	3546	P1236D Alice and the Doll brute force data structures greedy implementation *2300	0 / 0	8
	3525	P1239C Queue in the Train data structures greedy implementation *2300	0 / 0	8
	3507	P1244F Chips constructive algorithms implementation *2300	0 / 0	8
	3501	P1245E Hyakugoku and Ladders dp probabilities shortest paths *2300	0 / 0	8
	3500	P1245F Daniel and Spring Cleaning bitmasks brute force combinatorics dp *2300	0 / 0	8
	3482	P1250E The Coronation graphs implementation *2300	0 / 0	8
	3480	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	3468	P1251E1 Voting (Easy Version) data structures dp greedy *2300	0 / 0	8
	3464	P1252B Cleaning Robots dp trees *2300	0 / 0	8
	3456	P1252J Tiling Terrace brute force dp *2300	0 / 0	8
	3454	P1252L Road Construction flows graphs *2300	0 / 0	8
	3444	P1254C Point Ordering constructive algorithms geometry interactive math *2300	0 / 0	8
	3380	P1268C K Integers binary search data structures *2300	0 / 0	8
	3371	P1270E Divide Points constructive algorithms geometry math *2300	0 / 0	8
	3352	P1276C Beautiful Rectangle brute force combinatorics constructive algorithms data structures greedy math *2300	0 / 0	8
	3321	P1282D Enchanted Artifact constructive algorithms interactive strings *2300	0 / 0	8
	3302	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3274	P1292C Xenon's Attack on the Gangs combinatorics dfs and similar dp greedy trees *2300	0 / 0	8
	3205	P1304F1 Animal Observation (easy version) data structures dp *2300	0 / 0	8
	3185	P1310D Tourism dp graphs probabilities *2300	0 / 0	8
	3156	P1316E Team Building bitmasks dp greedy sortings *2300	0 / 0	8
	3144	P1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	8
	3034	P1342E Placing Rooks combinatorics fft math *2300	0 / 0	8
	3012	P1346G Two IP Cameras special problem math number theory 2300	0 / 0	8
	2848	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	8
	2814	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	2806	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	8
	2781	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	8
	2780	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	8
	2739	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	8
	2730	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	8
	2712	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	8
	2694	P1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	8
	2690	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2670	P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	8
	2656	P1411E Poman Numbers bitmasks greedy math strings *2300	0 / 0	8
	2605	P1422D Returning Home graphs shortest paths sortings *2300	0 / 0	8
	2583	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	8
	2474	P1450C2 Errich-Tac-Toe (Hard Version) constructive algorithms math *2300	0 / 0	8
	2462	P1451E2 Bitwise Queries (Hard Version) bitmasks constructive algorithms interactive math *2300	0 / 0	8
	2449	P1453E Dog Snacks binary search dfs and similar dp greedy trees *2300	0 / 0	8
	2379	P1468M Similar Sets data structures graphs implementation *2300	0 / 0	8
	2332	P1476E Pattern Matching bitmasks data structures dfs and similar graphs hashing sortings strings *2300	0 / 0	8
	2273	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	2238	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2233	P1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	8
	2137	P1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	8
	2060	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	8
	2026	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	8
	2011	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	8
	1988	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	8
	1950	P1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	8
	1942	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	8
	1927	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	8
	1917	P1553F Pairwise Modulo data structures math *2300	0 / 0	8
	1814	P1575B Building an Amusement Park binary search geometry *2300	0 / 0	8
	1807	P1575I Illusions of the Desert data structures trees *2300	0 / 0	8
	1752	P1584E Game with Stones binary search data structures games greedy *2300	0 / 0	8
	1737	P1592D Hemose in ICPC ? binary search dfs and similar implementation interactive math number theory trees *2300	0 / 0	8
	1720	P1594E2 Rubik's Cube Coloring (hard version) brute force dp implementation math trees *2300	0 / 0	8
	1700	P1600F Party Organization brute force math probabilities *2300	0 / 0	8
	1696	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	8
	1688	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	8
	1665	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	8
	1643	P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	8
	1613	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	8
	1563	P1621E New School binary search data structures dp greedy implementation sortings *2300	0 / 0	8
	1549	P1623D Robot Cleaner Revisit implementation math probabilities *2300	0 / 0	8
	1537	P1625D Binary Spiders bitmasks data structures implementation math sortings trees *2300	0 / 0	8
	1520	P1628C Grid Xor constructive algorithms greedy implementation interactive math *2300	0 / 0	8
	1405	P1654E Arithmetic Operations brute force data structures graphs math *2300	0 / 0	8
	1382	P1658D2 388535 (Hard Version) bitmasks brute force data structures math *2300	0 / 0	8
	1263	P1675G Sorting Pancakes dp *2300	0 / 0	8
	1227	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	1179	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1167	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1157	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1137	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	1131	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	1089	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	8
	1082	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8

Pick a problem randomly based on the current filter.