Problem Set - *2300 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1056	P1712E1 LCM Sum (easy version) binary search brute force combinatorics math number theory two pointers *2300	0 / 0	8
	968	P1728E Red-Black Pepper brute force data structures greedy math number theory *2300	0 / 0	8
	904	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	866	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	840	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	746	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	734	P1768E Partial Sorting combinatorics math number theory *2300	0 / 0	8
	652	P1780F Three Chairs bitmasks brute force combinatorics data structures dp number theory sortings *2300	0 / 0	8
	646	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	637	P1783E Game of the Year brute force data structures math number theory *2300	0 / 0	8
	598	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	554	P1797E Li Hua and Array brute force data structures dsu math number theory two pointers *2300	0 / 0	8
	548	P1798E Multitest Generator brute force dp *2300	0 / 0	8
	541	P1799E City Union constructive algorithms dfs and similar dsu geometry greedy implementation math *2300	0 / 0	8
	507	P1805E There Should Be a Lot of Maximums brute force data structures dfs and similar dp trees two pointers *2300	0 / 0	8
	445	P1814E Chain Chips data structures dp matrices *2300	0 / 0	8
	397	P1824B2 LuoTianyi and the Floating Islands (Hard Version) combinatorics dfs and similar math probabilities trees *2300	0 / 0	8
	342	P1834E MEX of LCM binary search data structures implementation math number theory *2300	0 / 0	8
	297	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	286	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	246	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers *2300	0 / 0	8
	177	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	154	P1864F Exotic Queries data structures implementation sortings *2300	0 / 0	8
	147	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	142	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	117	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	96	P1874C Jellyfish and EVA dp graphs greedy math probabilities *2300	0 / 0	8
	73	P1878G wxhtzdy ORO Tree binary search bitmasks brute force data structures dfs and similar implementation trees *2300	0 / 0	8
	3	P1895E Infinite Card Game binary search brute force data structures dfs and similar dp dsu games graphs greedy sortings two pointers *2300	0 / 0	8
	6651	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	6639	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	6631	P1917D Yet Another Inversions Problem combinatorics data structures dp implementation math number theory *2300	0 / 0	8
	7320	P1919F1 Wine Factory (Easy Version) data structures *2300	0 / 0	8
	8911	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
	8906	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	8900	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8899	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	9375	P1965C Folding Strip constructive algorithms greedy strings *2300	0 / 0	8
	9366	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
	9342	P1970B3 Exact Neighbours (Hard) constructive algorithms *2300	0 / 0	8
	9332	P1970F1 Playing Quidditch (Easy) implementation *2300	0 / 0	8
	9331	P1970F2 Playing Quidditch (Medium) implementation *2300	0 / 0	8
	9330	P1970F3 Playing Quidditch (Hard) implementation *2300	0 / 0	8

Pick a problem randomly based on the current filter.