Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	184	P1860D Balanced String dp *2200	0 / 0	8
	183	P1860E Fast Travel Text Editor data structures dfs and similar graphs shortest paths *2400	0 / 0	9
	182	P1860F Evaluate RBS data structures geometry implementation math sortings *2900	0 / 0	10
	181	P1861A Prime Deletion constructive algorithms math *800	0 / 0	3
	180	P1861B Two Binary Strings constructive algorithms dp greedy *1000	0 / 0	3
	179	P1861C Queries for the Array data structures dfs and similar implementation strings trees *1600	0 / 0	5
	178	P1861D Sorting By Multiplication dp greedy *1800	0 / 0	6
	177	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	176	P1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	10
	175	P1862A Gift Carpet dp greedy implementation strings *800	0 / 0	3
	174	P1862B Sequence Game constructive algorithms *800	0 / 0	3
	173	P1862C Flower City Fence binary search data structures implementation sortings *1100	0 / 0	3
	172	P1862D Ice Cream Balls binary search combinatorics constructive algorithms math *1300	0 / 0	4
	171	P1862E Kolya and Movie Theatre constructive algorithms data structures greedy *1600	0 / 0	5
	170	P1862F Magic Will Save the World binary search bitmasks brute force dp *1800	0 / 0	6
	169	P1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	7
	168	P1863A Channel greedy implementation *800	0 / 0	3
	167	P1863B Split Sort greedy math sortings *1100	0 / 0	3
	166	P1863C MEX Repetition implementation math *1100	0 / 0	3
	165	P1863D Two-Colored Dominoes constructive algorithms greedy *1400	0 / 0	4
	164	P1863E Speedrun brute force dfs and similar dp graphs greedy math sortings two pointers *2100	0 / 0	7
	163	P1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	10
	162	P1863G Swaps combinatorics dp graphs math *2800	0 / 0	10
	161	P1863H Goldberg Machine 3 dp trees *3500	0 / 0	10
	160	P1863I Redundant Routes constructive algorithms dp trees *3500	0 / 0	10
	159	P1864A Increasing and Decreasing constructive algorithms greedy implementation math *800	0 / 0	3
	158	P1864B Swap and Reverse constructive algorithms greedy sortings strings *1100	0 / 0	3
	157	P1864C Divisor Chain bitmasks constructive algorithms math number theory *1300	0 / 0	4
	156	P1864D Matrix Cascade brute force constructive algorithms data structures dp greedy math *1700	0 / 0	5
	155	P1864E Guess Game bitmasks data structures games math probabilities sortings strings trees *2100	0 / 0	7
	154	P1864F Exotic Queries data structures implementation sortings *2300	0 / 0	8
	153	P1864G Magic Square combinatorics constructive algorithms implementation *3100	0 / 0	10
	152	P1864H Asterism Stream dp math matrices *3200	0 / 0	10
	151	P1864I Future Dominators graphs greedy *3500	0 / 0	10
	150	P1866A Ambitious Kid math *800	0 / 0	3
	149	P1866B Battling with Numbers combinatorics math number theory *1400	0 / 0	4
	148	P1866C Completely Searching for Inversions dfs and similar dp graphs *1900	0 / 0	6
	147	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	146	P1866E Elevators of Tamem dp *2700	0 / 0	10
	145	P1866F Freak Joker Process binary search data structures sortings *3100	0 / 0	10
	144	P1866G Grouped Carriages binary search data structures dp flows greedy *2100	0 / 0	7
	143	P1866H Happy Sets combinatorics *2100	0 / 0	7
	142	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	141	P1866J Jackets and Packets dp *2800	0 / 0	10
	140	P1866K Keen Tree Calculation binary search data structures dp geometry graphs implementation trees *2500	0 / 0	9
	139	P1866L Lihmuf Balling binary search brute force math *2400	0 / 0	9
	138	P1866M Mighty Rock Tower brute force combinatorics dp math probabilities *2400	0 / 0	9
	137	P1867A green_gold_dog, array and permutation constructive algorithms sortings *800	0 / 0	3
	136	P1867B XOR Palindromes bitmasks constructive algorithms strings *1100	0 / 0	3
	135	P1867C Salyg1n and the MEX Game constructive algorithms data structures games greedy interactive *1300	0 / 0	4
	134	P1867D Cyclic Operations brute force constructive algorithms dfs and similar graphs greedy implementation *1800	0 / 0	6
	133	P1867E1 Salyg1n and Array (simple version) constructive algorithms interactive math *2000	0 / 0	7
	132	P1867E2 Salyg1n and Array (hard version) constructive algorithms interactive *2200	0 / 0	8
	131	P1867F Most Different Tree brute force constructive algorithms dfs and similar greedy hashing *2700	0 / 0	10
	130	P1868A Fill in the Matrix constructive algorithms implementation *1300	0 / 0	4
	129	P1868B1 Candy Party (Easy Version) bitmasks constructive algorithms graphs greedy implementation math *1700	0 / 0	5
	128	P1868B2 Candy Party (Hard Version) bitmasks constructive algorithms dp greedy implementation math *2100	0 / 0	7
	127	P1868C Travel Plan combinatorics dp implementation math trees *2400	0 / 0	9
	126	P1868D Flower-like Pseudotree constructive algorithms graphs greedy implementation trees *3000	0 / 0	10
	125	P1868E Min-Sum-Max constructive algorithms dp greedy *3500	0 / 0	10
	124	P1868F LIS? data structures greedy implementation *3500	0 / 0	10
	123	P1869A Make It Zero constructive algorithms *900	0 / 0	3
	122	P1869B 2D Traveling geometry math shortest paths sortings *1100	0 / 0	3
	121	P1870A MEXanized Array constructive algorithms greedy math *800	0 / 0	3
	120	P1870B Friendly Arrays bitmasks greedy math *1200	0 / 0	4
	119	P1870C Colorful Table binary search data structures dp implementation math two pointers *1300	0 / 0	4
	118	P1870D Prefix Purchase greedy implementation sortings *1800	0 / 0	6
	117	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	116	P1870F Lazy Numbers binary search math *2900	0 / 0	10
	115	P1870G MEXanization data structures *3300	0 / 0	10
	114	P1870H Standard Graph Problem data structures graphs greedy trees *3500	0 / 0	10
	113	P1872A Two Vessels brute force greedy math *800	0 / 0	3
	112	P1872B The Corridor or There and Back Again greedy implementation *900	0 / 0	3
	111	P1872C Non-coprime Split math number theory *1100	0 / 0	3
	110	P1872D Plus Minus Permutation math *1200	0 / 0	4
	109	P1872E Data Structures Fan binary search bitmasks data structures dp *1500	0 / 0	5
	108	P1872F Selling a Menagerie dfs and similar dsu graphs implementation math *1800	0 / 0	6
	107	P1872G Replace With Product brute force greedy math *2000	0 / 0	7
	106	P1873A Short Sort brute force implementation *800	0 / 0	3
	105	P1873B Good Kid brute force greedy math *800	0 / 0	3
	104	P1873C Target Practice implementation math *800	0 / 0	3
	103	P1873D 1D Eraser greedy implementation two pointers *800	0 / 0	3
	102	P1873E Building an Aquarium binary search sortings *1100	0 / 0	3
	101	P1873F Money Trees binary search greedy math two pointers *1300	0 / 0	4
	100	P1873G ABBC or BACB constructive algorithms greedy *1500	0 / 0	5
	99	P1873H Mad City dfs and similar dsu games graphs shortest paths trees *1700	0 / 0	5
	98	P1874A Jellyfish and Game brute force games greedy implementation *1200	0 / 0	4
	97	P1874B Jellyfish and Math bitmasks brute force dfs and similar dp graphs shortest paths *2400	0 / 0	9
	96	P1874C Jellyfish and EVA dp graphs greedy math probabilities *2300	0 / 0	8
	95	P1874D Jellyfish and Miku divide and conquer dp math probabilities *2800	0 / 0	10
	94	P1874E Jellyfish and Hack dp math *3000	0 / 0	10
	93	P1874F Jellyfish and OEIS dp *3500	0 / 0	10
	92	P1874G Jellyfish and Inscryption dp *3500	0 / 0	10
	91	P1875A Jellyfish and Undertale brute force greedy *900	0 / 0	3
	90	P1875C Jellyfish and Green Apple bitmasks greedy math number theory *1400	0 / 0	4
	89	P1875D Jellyfish and Mex dp *1600	0 / 0	5
	88	P1876A Helmets in Night Light greedy sortings *1000	0 / 0	3
	87	P1876B Effects of Anti Pimples combinatorics number theory sortings *1500	0 / 0	5
	86	P1876C Autosynthesis constructive algorithms dfs and similar graphs greedy sortings *2100	0 / 0	7
	85	P1876D Lexichromatography combinatorics dfs and similar dsu graphs two pointers *2500	0 / 0	9

Pick a problem randomly based on the current filter.