Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2056	codeforces#P1529A Eshag Loves Big Arrays constructive algorithms greedy math *800	0 / 0	3
	2055	codeforces#P1529B Sifid and Strange Subsequences greedy math sortings *1100	0 / 0	3
	2054	codeforces#P1530A Binary Decimal greedy math *800	0 / 0	3
	2053	codeforces#P1530B Putting Plates constructive algorithms implementation *800	0 / 0	3
	2052	codeforces#P1530C Pursuit binary search brute force greedy sortings *1200	0 / 0	4
	2051	codeforces#P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2050	codeforces#P1530E Minimax constructive algorithms greedy strings *2100	0 / 0	7
	2049	codeforces#P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	10
	2048	codeforces#P1530G What a Reversal constructive algorithms *3300	0 / 0	10
	2047	codeforces#P1530H Turing's Award data structures dp *3400	0 / 0	10
	2046	codeforces#P1532A A+B (Trial Problem) *special problem	0 / 0	(None)
	2045	codeforces#P1532B Frog Jumping *special problem math	0 / 0	(None)
	2044	codeforces#P1532C Uniform String *special problem implementation	0 / 0	(None)
	2043	codeforces#P1532D Teams Forming *special problem sortings	0 / 0	(None)
	2042	codeforces#P1532E Good Array *special problem	0 / 0	(None)
	2041	codeforces#P1532F Prefixes and Suffixes *special problem strings	0 / 0	(None)
	2040	codeforces#P1533A Travel to Bertown *special problem implementation math	0 / 0	(None)
	2039	codeforces#P1533B Nearest Point Function *special problem implementation	0 / 0	(None)
	2038	codeforces#P1533C Sweets *special problem data structures implementation	0 / 0	(None)
	2037	codeforces#P1533D String Searching *special problem hashing	0 / 0	(None)
	2036	codeforces#P1533E Chess Team Forming *special problem binary search data structures greedy	0 / 0	(None)
	2035	codeforces#P1533F Binary String Partition *special problem binary search greedy	0 / 0	(None)
	2034	codeforces#P1533G Biome Map *special problem constructive algorithms dfs and similar graphs	0 / 0	(None)
	2033	codeforces#P1533H Submatrices *special problem bitmasks data structures dp	0 / 0	(None)
	2032	codeforces#P1533I Excursions *special problem constructive algorithms dfs and similar flows graph matchings graphs	0 / 0	(None)
	2031	codeforces#P1533J Pawns *special problem	0 / 0	(None)
	2030	codeforces#P1534A Colour the Flag brute force implementation *800	0 / 0	3
	2029	codeforces#P1534B Histogram Ugliness greedy implementation math *1100	0 / 0	3
	2028	codeforces#P1534C Little Alawn's Puzzle combinatorics dp dsu graphs math *1300	0 / 0	4
	2027	codeforces#P1534D Lost Tree constructive algorithms interactive trees *1800	0 / 0	6
	2026	codeforces#P1534E Lost Array graphs greedy interactive shortest paths *2300	0 / 0	8
	2025	codeforces#P1534F1 Falling Sand (Easy Version) dfs and similar graphs greedy *2500	0 / 0	9
	2024	codeforces#P1534F2 Falling Sand (Hard Version) dfs and similar dp graphs greedy *3000	0 / 0	10
	2023	codeforces#P1534G A New Beginning data structures dp geometry sortings *3300	0 / 0	10
	2022	codeforces#P1534H Lost Nodes constructive algorithms dp graphs interactive sortings trees *3500	0 / 0	10
	2021	codeforces#P1535A Fair Playoff brute force implementation *800	0 / 0	3
	2020	codeforces#P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3
	2019	codeforces#P1535C Unstable String binary search dp greedy implementation strings two pointers *1400	0 / 0	4
	2018	codeforces#P1535D Playoff Tournament data structures dfs and similar dp implementation trees *1800	0 / 0	6
	2017	codeforces#P1535E Gold Transfer binary search data structures dp greedy interactive trees *2200	0 / 0	8
	2016	codeforces#P1535F String Distance binary search brute force data structures hashing implementation strings *3000	0 / 0	10
	2015	codeforces#P1536A Omkar and Bad Story brute force constructive algorithms *800	0 / 0	3
	2014	codeforces#P1536B Prinzessin der Verurteilung brute force constructive algorithms strings *1200	0 / 0	4
	2013	codeforces#P1536C Diluc and Kaeya data structures dp hashing number theory *1500	0 / 0	5
	2012	codeforces#P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	7
	2011	codeforces#P1536E Omkar and Forest combinatorics graphs math shortest paths *2300	0 / 0	8
	2010	codeforces#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	codeforces#P1537A Arithmetic Array greedy math *800	0 / 0	3
	2008	codeforces#P1537B Bad Boy constructive algorithms greedy math *900	0 / 0	3
	2007	codeforces#P1537C Challenging Cliffs constructive algorithms greedy implementation math *1200	0 / 0	4
	2006	codeforces#P1537D Deleting Divisors games math number theory *1700	0 / 0	5
	2005	codeforces#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	codeforces#P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	8
	2003	codeforces#P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	2002	codeforces#P1538A Stone Game brute force dp greedy *800	0 / 0	3
	2001	codeforces#P1538B Friends and Candies greedy math *800	0 / 0	3
	2000	codeforces#P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	4
	1999	codeforces#P1538D Another Problem About Dividing Numbers constructive algorithms math number theory *1700	0 / 0	5
	1998	codeforces#P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	7
	1997	codeforces#P1538F Interesting Function binary search dp math number theory *1500	0 / 0	5
	1996	codeforces#P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	7
	1995	codeforces#P1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	3
	1994	codeforces#P1539B Love Song dp implementation strings *800	0 / 0	3
	1993	codeforces#P1539C Stable Groups greedy sortings *1200	0 / 0	4
	1992	codeforces#P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	5
	1991	codeforces#P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	9
	1990	codeforces#P1539F Strange Array data structures greedy sortings *2600	0 / 0	10
	1989	codeforces#P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	4
	1988	codeforces#P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	8
	1987	codeforces#P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	10
	1986	codeforces#P1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	10
	1985	codeforces#P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	10
	1984	codeforces#P1540E Tasty Dishes math matrices *3500	0 / 0	10
	1983	codeforces#P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	3
	1982	codeforces#P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	4
	1981	codeforces#P1542A Odd Set math *800	0 / 0	3
	1980	codeforces#P1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	5
	1979	codeforces#P1542C Strange Function math number theory *1600	0 / 0	5
	1978	codeforces#P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	1977	codeforces#P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	9
	1976	codeforces#P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	10
	1975	codeforces#P1543A Exciting Bets greedy math number theory *900	0 / 0	3
	1974	codeforces#P1543B Customising the Track combinatorics greedy math *900	0 / 0	3
	1973	codeforces#P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	1972	codeforces#P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	5
	1971	codeforces#P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	1970	codeforces#P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	1969	codeforces#P1545A AquaMoon and Strange Sort sortings *1500	0 / 0	5
	1968	codeforces#P1545B AquaMoon and Chess combinatorics math *1900	0 / 0	6
	1967	codeforces#P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	10
	1966	codeforces#P1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	10
	1965	codeforces#P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	10
	1964	codeforces#P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	10
	1963	codeforces#P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	10
	1962	codeforces#P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	3
	1961	codeforces#P1546B AquaMoon and Stolen String interactive math *1200	0 / 0	4
	1960	codeforces#P1547A Shortest Path with Obstacle implementation math *800	0 / 0	3
	1959	codeforces#P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	3
	1958	codeforces#P1547C Pair Programming greedy two pointers *1100	0 / 0	3
	1957	codeforces#P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	4

Pick a problem randomly based on the current filter.