Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2184	P1505H L BREAK into program special problem 2500	0 / 0	9
	2183	P1505I Mysterious language again, seriously? special problem 2200	0 / 0	8
	2182	P1506A Strange Table math *800	0 / 0	3
	2181	P1506B Partial Replacement greedy implementation *1100	0 / 0	3
	2180	P1506C Double-ended Strings brute force implementation strings *1000	0 / 0	3
	2179	P1506D Epic Transformation constructive algorithms data structures greedy *1400	0 / 0	4
	2178	P1506E Restoring the Permutation constructive algorithms implementation *1500	0 / 0	5
	2177	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	7
	2176	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	7
	2175	P1508A Binary Literature constructive algorithms greedy implementation strings two pointers *1900	0 / 0	6
	2174	P1508B Almost Sorted binary search combinatorics constructive algorithms implementation *1800	0 / 0	6
	2173	P1508C Complete the MST bitmasks brute force data structures dfs and similar dsu graphs greedy trees *2500	0 / 0	9
	2172	P1508D Swap Pass constructive algorithms geometry sortings *3000	0 / 0	10
	2171	P1508E Tree Calendar brute force constructive algorithms data structures dfs and similar sortings trees *3100	0 / 0	10
	2170	P1508F Optimal Encoding brute force data structures *3500	0 / 0	10
	2169	P1509A Average Height constructive algorithms *800	0 / 0	3
	2168	P1509B TMT Document greedy *1100	0 / 0	3
	2167	P1509C The Sports Festival dp greedy *1800	0 / 0	6
	2166	P1510A __NO_TITLE__	0 / 0	(None)
	2165	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	10
	2164	P1510C Cactus Not Enough dfs and similar graph matchings graphs *2900	0 / 0	10
	2163	P1510D Digits dp math number theory *2100	0 / 0	7
	2162	P1510E __NO_TITLE__	0 / 0	(None)
	2161	P1510F Fiber Shape *2800	0 / 0	10
	2160	P1510G __NO_TITLE__	0 / 0	(None)
	2159	P1510H Hard Optimization dp *3200	0 / 0	10
	2158	P1510I Is It Rated? greedy interactive math probabilities *2700	0 / 0	10
	2157	P1510J Japanese Game constructive algorithms math *2700	0 / 0	10
	2156	P1510K King's Task brute force graphs implementation *1200	0 / 0	4
	2155	P1511A Review Site greedy *800	0 / 0	3
	2154	P1511B GCD Length constructive algorithms math number theory *1100	0 / 0	3
	2153	P1511C Yet Another Card Deck brute force data structures implementation trees *1100	0 / 0	3
	2152	P1511D Min Cost String brute force constructive algorithms graphs greedy strings *1600	0 / 0	5
	2151	P1511E Colorings and Dominoes combinatorics dp greedy math *2100	0 / 0	7
	2150	P1511F Chainword brute force data structures dp matrices string suffix structures strings *2700	0 / 0	10
	2149	P1511G Chips on a Board bitmasks brute force data structures dp games two pointers *2700	0 / 0	10
	2148	P1512A Spy Detected! brute force implementation *800	0 / 0	3
	2147	P1512B Almost Rectangle implementation *800	0 / 0	3
	2146	P1512C A-B Palindrome constructive algorithms implementation strings *1200	0 / 0	4
	2145	P1512D Corrupted Array constructive algorithms data structures greedy *1200	0 / 0	4
	2144	P1512E Permutation by Sum brute force greedy math *1600	0 / 0	5
	2143	P1512F Education brute force dp greedy implementation *1900	0 / 0	6
	2142	P1512G Short Task brute force dp math number theory *1700	0 / 0	5
	2141	P1513A Array and Peaks constructive algorithms implementation *800	0 / 0	3
	2140	P1513B AND Sequences bitmasks combinatorics constructive algorithms math *1400	0 / 0	4
	2139	P1513C Add One dp matrices *1600	0 / 0	5
	2138	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	7
	2137	P1513E Cost Equilibrium combinatorics constructive algorithms math sortings *2300	0 / 0	8
	2136	P1513F Swapping Problem brute force constructive algorithms data structures sortings *2500	0 / 0	9
	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
	2133	P1514C Product 1 Modulo N greedy number theory *1600	0 / 0	5
	2132	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	7
	2131	P1514E Baby Ehab's Hyper Apartment binary search graphs interactive sortings two pointers *2700	0 / 0	10
	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
	2128	P1515C Phoenix and Towers constructive algorithms data structures greedy *1400	0 / 0	4
	2127	P1515D Phoenix and Socks greedy sortings two pointers *1500	0 / 0	5
	2126	P1515E Phoenix and Computers combinatorics dp math *2200	0 / 0	8
	2125	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	10
	2124	P1515G Phoenix and Odometers dfs and similar graphs math number theory *2700	0 / 0	10
	2123	P1515H Phoenix and Bits bitmasks brute force data structures sortings *3500	0 / 0	10
	2122	P1515I Phoenix and Diamonds binary search data structures sortings *3400	0 / 0	10
	2121	P1516A Tit for Tat greedy *800	0 / 0	3
	2120	P1516B AGAGA XOOORRR bitmasks brute force dp greedy *1500	0 / 0	5
	2119	P1516C Baby Ehab Partitions Again bitmasks constructive algorithms dp math *1700	0 / 0	5
	2118	P1516D Cut binary search data structures dp graphs number theory two pointers *2100	0 / 0	7
	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
	2115	P1517B Morning Jogging constructive algorithms greedy sortings *1200	0 / 0	4
	2114	P1517C Fillomino 2 constructive algorithms dfs and similar greedy implementation *1400	0 / 0	4
	2113	P1517D Explorer Space dp graphs shortest paths *1800	0 / 0	6
	2112	P1517E Group Photo binary search data structures implementation two pointers *2500	0 / 0	9
	2111	P1517F Reunion combinatorics dp trees *3200	0 / 0	10
	2110	P1517G Starry Night Camping constructive algorithms flows graphs *3300	0 / 0	10
	2109	P1517H Fly Around the World dp geometry *3500	0 / 0	10
	2108	P1519A Red and Blue Beans math *800	0 / 0	3
	2107	P1519B The Cake Is a Lie dp math *800	0 / 0	3
	2106	P1519C Berland Regional brute force data structures greedy number theory sortings *1400	0 / 0	4
	2105	P1519D Maximum Sum of Products brute force dp implementation math two pointers *1600	0 / 0	5
	2104	P1519E Off by One constructive algorithms dfs and similar geometry graphs sortings trees *2700	0 / 0	10
	2103	P1519F Chests and Keys bitmasks brute force dfs and similar dp flows *3200	0 / 0	10
	2102	P1520A Do Not Be Distracted! brute force implementation *800	0 / 0	3
	2101	P1520B Ordinary Numbers brute force math number theory *800	0 / 0	3
	2100	P1520C Not Adjacent Matrix constructive algorithms *1000	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
	2097	P1520F1 Guess the K-th Zero (Easy version) binary search interactive *1600	0 / 0	5
	2096	P1520F2 Guess the K-th Zero (Hard version) binary search constructive algorithms data structures interactive *2200	0 / 0	8
	2095	P1520G To Go Or Not To Go? brute force dfs and similar graphs greedy implementation shortest paths *2200	0 / 0	8
	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
	2092	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	7
	2091	P1521D Nastia Plays with a Tree constructive algorithms data structures dfs and similar dp dsu greedy implementation trees *2500	0 / 0	9
	2090	P1521E Nastia and a Beautiful Matrix binary search constructive algorithms dp greedy *2700	0 / 0	10
	2089	P1523A Game of Life implementation *800	0 / 0	3
	2088	P1523B Lord of the Values constructive algorithms *1100	0 / 0	3
	2087	P1523C Compression and Expansion brute force data structures greedy implementation trees *1600	0 / 0	5
	2086	P1523D Love-Hate bitmasks brute force dp probabilities *2400	0 / 0	9
	2085	P1523E Crypto Lights combinatorics dp math probabilities *2600	0 / 0	10

Pick a problem randomly based on the current filter.