Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2084	P1523F Favorite Game bitmasks dp *3300	0 / 0	10
	2083	P1523G Try Booking data structures divide and conquer *3200	0 / 0	10
	2082	P1523H Hopping Around the Array data structures dp *3500	0 / 0	10
	2081	P1525A Potion-making math number theory *800	0 / 0	3
	2080	P1525B Permutation Sort constructive algorithms greedy *900	0 / 0	3
	2079	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	7
	2078	P1525D Armchairs dp flows graph matchings greedy *1800	0 / 0	6
	2077	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	7
	2076	P1525F Goblins And Gnomes brute force dp flows graph matchings *2800	0 / 0	10
	2075	P1526A Mean Inequality constructive algorithms sortings *800	0 / 0	3
	2074	P1526B I Hate 1111 dp math number theory *1400	0 / 0	4
	2073	P1526C1 Potions (Easy Version) brute force data structures dp greedy *1500	0 / 0	5
	2072	P1526C2 Potions (Hard Version) data structures greedy *1600	0 / 0	5
	2071	P1526D Kill Anton brute force constructive algorithms data structures math strings *2200	0 / 0	8
	2070	P1526E Oolimry and Suffix Array combinatorics constructive algorithms math *2400	0 / 0	9
	2069	P1526F Median Queries constructive algorithms interactive probabilities *3000	0 / 0	10
	2068	P1527A And Then There Were K bitmasks *800	0 / 0	3
	2067	P1527B1 Palindrome Game (easy version) constructive algorithms games *1200	0 / 0	4
	2066	P1527B2 Palindrome Game (hard version) constructive algorithms games *1900	0 / 0	6
	2065	P1527C Sequence Pair Weight hashing implementation math *1600	0 / 0	5
	2064	P1527D MEX Tree combinatorics dfs and similar implementation math trees *2400	0 / 0	9
	2063	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	9
	2062	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	2061	P1528B Kavi on Pairing Duty combinatorics dp math *1700	0 / 0	5
	2060	P1528C Trees of Tranquillity data structures dfs and similar greedy trees *2300	0 / 0	8
	2059	P1528D It's a bird! No, it's a plane! No, it's AaParsa! constructive algorithms graphs shortest paths *2500	0 / 0	9
	2058	P1528E Mashtali and Hagh Trees combinatorics dp trees *2900	0 / 0	10
	2057	P1528F AmShZ Farm combinatorics fft math *3300	0 / 0	10
	2056	P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	3
	2055	P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	3
	2054	P1530A Binary Decimal greedy math *800	0 / 0	3
	2053	P1530B Putting Plates constructive algorithms implementation *800	0 / 0	3
	2052	P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2051	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2050	P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2049	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	10
	2048	P1530G What a Reversal constructive algorithms *3300	0 / 0	10
	2047	P1530H Turing's Award data structures dp *3400	0 / 0	10
	2046	P1532A A+B (Trial Problem) *special problem	0 / 0	(None)
	2045	P1532B Frog Jumping *special problem math	0 / 0	(None)
	2044	P1532C Uniform String *special problem implementation	0 / 0	(None)
	2043	P1532D Teams Forming *special problem sortings	0 / 0	(None)
	2042	P1532E Good Array *special problem	0 / 0	(None)
	2041	P1532F Prefixes and Suffixes *special problem strings	0 / 0	(None)
	2040	P1533A Travel to Bertown *special problem implementation math	0 / 0	(None)
	2039	P1533B Nearest Point Function *special problem implementation	0 / 0	(None)
	2038	P1533C Sweets *special problem data structures implementation	0 / 0	(None)
	2037	P1533D String Searching *special problem hashing	0 / 0	(None)
	2036	P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)
	2035	P1533F Binary String Partition *special problem binary search greedy	0 / 0	(None)
	2034	P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	2033	P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
	2032	P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	2031	P1533J Pawns *special problem	0 / 0	(None)
	2030	P1534A Colour the Flag brute force implementation *800	0 / 0	3
	2029	P1534B Histogram Ugliness greedy implementation math *1100	0 / 0	3
	2028	P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	4
	2027	P1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	6
	2026	P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	8
	2025	P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	9
	2024	P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	10
	2023	P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	10
	2022	P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	2021	P1535A Fair Playoff brute force implementation *800	0 / 0	3
	2020	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3
	2019	P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2018	P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	6
	2017	P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2016	P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2015	P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	3
	2014	P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	4
	2013	P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	5
	2012	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	2011	P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	8
	2010	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	10
	2009	P1537A Arithmetic Array greedy math *800	0 / 0	3
	2008	P1537B Bad Boy constructive algorithms greedy math *900	0 / 0	3
	2007	P1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	4
	2006	P1537D Deleting Divisors games math number theory *1700	0 / 0	5
	2005	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	5
	2004	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2003	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2002	P1538A Stone Game brute force dp greedy *800	0 / 0	3
	2001	P1538B Friends and Candies greedy math *800	0 / 0	3
	2000	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	4
	1999	P1538D Another Problem About Dividing Numbers constructive algorithms math number theory *1700	0 / 0	5
	1998	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	1997	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	5
	1996	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	1995	P1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	3
	1994	P1539B Love Song dp implementation strings *800	0 / 0	3
	1993	P1539C Stable Groups greedy sortings *1200	0 / 0	4
	1992	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	1991	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	1990	P1539F Strange Array data structures greedy sortings *2600	0 / 0	10
	1989	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	1988	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	8
	1987	P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	10
	1986	P1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	10
	1985	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10

Pick a problem randomly based on the current filter.