Problem Set - math - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2235	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	4
	2232	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	10
	2228	P1496B Max and Mex math *1100	0 / 0	3
	2226	P1497B M-arrays constructive algorithms greedy math *1200	0 / 0	4
	2225	P1497C1 k-LCM (easy version) constructive algorithms math *1200	0 / 0	4
	2224	P1497C2 k-LCM (hard version) constructive algorithms math *1600	0 / 0	5
	2222	P1497E1 Square-Free Division (easy version) data structures dp greedy math number theory two pointers *1700	0 / 0	5
	2221	P1497E2 Square-Free Division (hard version) data structures dp greedy math number theory two pointers *2500	0 / 0	9
	2220	P1498A GCD Sum brute force math *800	0 / 0	3
	2215	P1498F Christmas Game bitmasks data structures dfs and similar dp games math trees *2500	0 / 0	9
	2214	P1499A Domino on Windowsill combinatorics constructive algorithms math *800	0 / 0	3
	2212	P1499C Minimum Grid Path brute force data structures greedy math *1500	0 / 0	5
	2211	P1499D The Number of Pairs dp math number theory *2100	0 / 0	7
	2210	P1499E Chaotic Merge combinatorics dp math strings *2400	0 / 0	9
	2207	P1500A Going Home brute force hashing implementation math *1800	0 / 0	6
	2206	P1500B Two chandeliers binary search brute force chinese remainder theorem math number theory *2200	0 / 0	8
	2195	P1503E 2-Coloring combinatorics dp math *3100	0 / 0	10
	2192	P1504B Flip the Bits constructive algorithms greedy implementation math *1200	0 / 0	4
	2186	P1505F Math special problem math 2200	0 / 0	8
	2182	P1506A Strange Table math *800	0 / 0	3
	2177	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2163	P1510D Digits dp math number theory *2100	0 / 0	7
	2158	P1510I Is It Rated? greedy interactive math probabilities *2700	0 / 0	10
	2157	P1510J Japanese Game constructive algorithms math *2700	0 / 0	10
	2154	P1511B GCD Length constructive algorithms math number theory *1100	0 / 0	3
	2151	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2144	P1512E Permutation by Sum brute force greedy math *1600	0 / 0	5
	2142	P1512G Short Task brute force dp math number theory *1700	0 / 0	5
	2140	P1513B AND Sequences bitmasks combinatorics constructive algorithms math *1400	0 / 0	4
	2137	P1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	8
	2135	P1514A Perfectly Imperfect Array math number theory *800	0 / 0	3
	2134	P1514B AND 0, Sum Big bitmasks combinatorics math *1200	0 / 0	4
	2130	P1515A Phoenix and Gold constructive algorithms greedy math *800	0 / 0	3
	2129	P1515B Phoenix and Puzzle brute force geometry math number theory *1000	0 / 0	3
	2126	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	2124	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	10
	2119	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	5
	2117	P1516E Baby Ehab Plays with Permutations combinatorics dp math *2500	0 / 0	9
	2116	P1517A Sum of 2050 greedy math *800	0 / 0	3
	2108	P1519A Red and Blue Beans math *800	0 / 0	3
	2107	P1519B The Cake Is a Lie dp math *800	0 / 0	3
	2105	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	5
	2101	P1520B Ordinary Numbers brute force math number theory *800	0 / 0	3
	2099	P1520D Same Differences data structures hashing math *1200	0 / 0	4
	2098	P1520E Arranging The Sheep greedy math *1400	0 / 0	4
	2094	P1521A Nastia and Nearly Good Numbers constructive algorithms math number theory *1000	0 / 0	3
	2093	P1521B Nastia and a Good Array constructive algorithms math number theory *1300	0 / 0	4
	2085	P1523E Crypto Lights combinatorics dp math probabilities *2600	0 / 0	10
	2081	P1525A Potion-making math number theory *800	0 / 0	3
	2077	P1525E Assimilation IV combinatorics dp math probabilities two pointers *2100	0 / 0	7
	2074	P1526B I Hate 1111 dp math number theory *1400	0 / 0	4
	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
	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
	2061	P1528B Kavi on Pairing Duty combinatorics dp math *1700	0 / 0	5
	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
	2051	P1530D Secret Santa constructive algorithms flows graphs greedy math *1600	0 / 0	5
	2049	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	10
	2045	P1532B Frog Jumping *special problem math	0 / 0	(None)
	2040	P1533A Travel to Bertown *special problem implementation math	0 / 0	(None)
	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
	2020	P1535B Array Reodering brute force greedy math number theory sortings *900	0 / 0	3
	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
	2003	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	8
	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
	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
	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
	1984	P1540E Tasty Dishes math matrices *3500	0 / 0	10
	1982	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	4
	1981	P1542A Odd Set math *800	0 / 0	3
	1980	P1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	5
	1979	P1542C Strange Function math number theory *1600	0 / 0	5
	1978	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	8
	1977	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	9
	1976	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	10
	1975	P1543A Exciting Bets greedy math number theory *900	0 / 0	3
	1974	P1543B Customising the Track combinatorics greedy math *900	0 / 0	3
	1973	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	6
	1972	P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	5
	1971	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	8
	1970	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	10
	1968	P1545B AquaMoon and Chess combinatorics math *1900	0 / 0	6
	1966	P1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	10
	1961	P1546B AquaMoon and Stolen String interactive math *1200	0 / 0	4

Pick a problem randomly based on the current filter.