Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2284	P1487B Cat Cycle math number theory *1200	0 / 0	4
	2283	P1487C Minimum Ties brute force constructive algorithms dfs and similar graphs greedy implementation math *1500	0 / 0	5
	2282	P1487D Pythagorean Triples binary search brute force math number theory *1500	0 / 0	5
	2281	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	7
	2280	P1487F Ones dp greedy shortest paths *2900	0 / 0	10
	2279	P1487G String Counting combinatorics dp fft math *2700	0 / 0	10
	2278	P1488A From Zero To Y special problem math 900	0 / 0	3
	2277	P1488B RBS Deletion special problem greedy 1800	0 / 0	6
	2276	P1488C Two Policemen special problem binary search brute force math 1900	0 / 0	6
	2275	P1488D Problemsolving Marathon special problem binary search greedy 1900	0 / 0	6
	2274	P1488E Palindromic Doubles special problem data structures dp 2200	0 / 0	8
	2273	P1488F Dogecoin special problem special problem binary search data structures *2300	0 / 0	8
	2272	P1488G Painting Numbers special problem data structures greedy number theory 2500	0 / 0	9
	2271	P1488H Build From Suffixes special problem combinatorics data structures 2800	0 / 0	10
	2270	P1488I Demonic Invasion special problem flows 3100	0 / 0	10
	2269	P1488J Flower Shop special problem data structures fft math 3100	0 / 0	10
	2268	P1490A Dense Array greedy math *800	0 / 0	3
	2267	P1490B Balanced Remainders brute force constructive algorithms math *1000	0 / 0	3
	2266	P1490C Sum of Cubes binary search brute force brute force math *1100	0 / 0	3
	2265	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	4
	2264	P1490E Accidental Victory binary search data structures greedy *1400	0 / 0	4
	2263	P1490F Equalize the Array binary search data structures greedy math sortings *1500	0 / 0	5
	2262	P1490G Old Floppy Drive binary search data structures math *1900	0 / 0	6
	2261	P1491A K-th Largest Value brute force greedy implementation *800	0 / 0	3
	2260	P1491B Minimal Cost brute force math *1200	0 / 0	4
	2259	P1491C Pekora and Trampoline brute force data structures dp greedy implementation *1700	0 / 0	5
	2258	P1491D Zookeeper and The Infinite Zoo bitmasks constructive algorithms dp greedy math *1800	0 / 0	6
	2257	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	9
	2256	P1491F Magnets binary search constructive algorithms interactive *2700	0 / 0	10
	2255	P1491G Switch and Flip constructive algorithms graphs math *2800	0 / 0	10
	2254	P1491H Yuezheng Ling and Dynamic Tree data structures trees *3400	0 / 0	10
	2253	P1491I Ruler Of The Zoo brute force data structures *3500	0 / 0	10
	2252	P1492A Three swimmers math *800	0 / 0	3
	2251	P1492B Card Deck data structures greedy math *1100	0 / 0	3
	2250	P1492C Maximum width binary search data structures dp greedy two pointers *1500	0 / 0	5
	2249	P1492D Genius's Gambit bitmasks constructive algorithms greedy math *1900	0 / 0	6
	2248	P1492E Almost Fault-Tolerant Database brute force constructive algorithms dfs and similar greedy implementation *2500	0 / 0	9
	2247	P1493A Anti-knapsack constructive algorithms greedy *800	0 / 0	3
	2246	P1493B Planet Lapituletti brute force implementation *1300	0 / 0	4
	2245	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	7
	2244	P1493D GCD of an Array brute force data structures hashing implementation math number theory sortings two pointers *2100	0 / 0	7
	2243	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	10
	2242	P1493F Enchanted Matrix bitmasks interactive number theory *2600	0 / 0	10
	2241	P1494A ABC String bitmasks brute force implementation *900	0 / 0	3
	2240	P1494B Berland Crossword bitmasks brute force greedy implementation *1400	0 / 0	4
	2239	P1494C 1D Sokoban binary search dp greedy implementation two pointers *1900	0 / 0	6
	2238	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	2237	P1494E A-Z Graph constructive algorithms data structures graphs hashing *2400	0 / 0	9
	2236	P1494F Delete The Edges brute force constructive algorithms dfs and similar graphs implementation *2900	0 / 0	10
	2235	P1495A Diamond Miner geometry greedy math sortings *1200	0 / 0	4
	2234	P1495B Let's Go Hiking games greedy *1900	0 / 0	6
	2233	P1495C Garden of the Sun constructive algorithms graphs *2300	0 / 0	8
	2232	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	10
	2231	P1495E Qingshan and Daniel brute force data structures greedy implementation *3200	0 / 0	10
	2230	P1495F Squares constructive algorithms data structures dp graphs trees *3300	0 / 0	10
	2229	P1496A Split it! brute force constructive algorithms greedy strings *900	0 / 0	3
	2228	P1496B Max and Mex math *1100	0 / 0	3
	2227	P1497A Meximization brute force data structures greedy sortings *800	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
	2223	P1497D Genius bitmasks dp graphs number theory *2500	0 / 0	9
	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
	2219	P1498B Box Fitting binary search bitmasks data structures greedy *1300	0 / 0	4
	2218	P1498C Planar Reflections brute force data structures dp *1600	0 / 0	5
	2217	P1498D Bananas in a Microwave dfs and similar dp graphs implementation *2200	0 / 0	8
	2216	P1498E Two Houses brute force graphs greedy interactive sortings *2200	0 / 0	8
	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
	2213	P1499B Binary Removals brute force dp greedy implementation *1000	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
	2209	P1499F Diameter Cuts combinatorics dfs and similar dp trees *2400	0 / 0	9
	2208	P1499G Graph Coloring data structures graphs interactive *3100	0 / 0	10
	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
	2205	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	10
	2204	P1500D Tiles for Bathroom data structures sortings two pointers *2900	0 / 0	10
	2203	P1500E Subset Trick binary search data structures *3300	0 / 0	10
	2202	P1500F Cupboards Jumps dp *3500	0 / 0	10
	2201	P1501A Alexey and Train implementation *800	0 / 0	3
	2200	P1501B Napoleon Cake dp implementation sortings *900	0 / 0	3
	2199	P1503A Balance the Bits constructive algorithms greedy *1600	0 / 0	5
	2198	P1503B 3-Coloring constructive algorithms games interactive *1700	0 / 0	5
	2197	P1503C Travelling Salesman Problem binary search data structures dp greedy shortest paths sortings two pointers *2200	0 / 0	8
	2196	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	10
	2195	P1503E 2-Coloring combinatorics dp math *3100	0 / 0	10
	2194	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	10
	2193	P1504A Déjà Vu constructive algorithms strings *800	0 / 0	3
	2192	P1504B Flip the Bits constructive algorithms greedy implementation math *1200	0 / 0	4
	2191	P1505A Is it rated - 2 special problem implementation interactive 900	0 / 0	3
	2190	P1505B DMCA special problem implementation number theory 1600	0 / 0	5
	2189	P1505C Fibonacci Words special problem implementation 1400	0 / 0	4
	2188	P1505D Xenolith? Hippodrome? special problem number theory 1800	0 / 0	6
	2187	P1505E Cakewalk special problem greedy implementation shortest paths 1800	0 / 0	6
	2186	P1505F Math special problem math 2200	0 / 0	8
	2185	P1505G Encoded message special problem implementation 2600	0 / 0	10

Pick a problem randomly based on the current filter.