Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6662	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	6661	P1913E Matrix Problem flows graphs *2400	0 / 0	9
	6660	P1913F Palindromic Problem binary search data structures hashing string suffix structures strings *2800	0 / 0	10
	6659	P1914A Problemsolving Log implementation strings *800	0 / 0	3
	6658	P1914B Preparing for the Contest constructive algorithms math *800	0 / 0	3
	6657	P1914C Quests greedy math *1100	0 / 0	3
	6656	P1914D Three Activities brute force dp greedy implementation sortings *1200	0 / 0	4
	6655	P1914E1 Game with Marbles (Easy Version) brute force games greedy sortings *1400	0 / 0	4
	6654	P1914E2 Game with Marbles (Hard Version) games greedy sortings *1400	0 / 0	4
	6653	P1914F Programming Competition dfs and similar dp graph matchings greedy trees *1900	0 / 0	6
	6652	P1914G1 Light Bulbs (Easy Version) brute force combinatorics dfs and similar dp dsu graphs math trees *2100	0 / 0	7
	6651	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	6650	P1915A Odd One Out bitmasks implementation *800	0 / 0	3
	6649	P1915B Not Quite Latin Square bitmasks brute force implementation *800	0 / 0	3
	6648	P1915C Can I Square? binary search implementation *800	0 / 0	3
	6647	P1915D Unnatural Language Processing greedy implementation strings *900	0 / 0	3
	6646	P1915E Romantic Glasses data structures greedy math *1300	0 / 0	4
	6645	P1915F Greetings data structures divide and conquer sortings *1500	0 / 0	5
	6644	P1915G Bicycles graphs greedy implementation shortest paths sortings *1800	0 / 0	6
	6643	P1916A 2023 constructive algorithms implementation math number theory *800	0 / 0	3
	6642	P1916B Two Divisors constructive algorithms math number theory *900	0 / 0	3
	6641	P1916C Training Before the Olympiad constructive algorithms games greedy implementation math *1200	0 / 0	4
	6640	P1916D Mathematical Problem brute force constructive algorithms geometry math *1700	0 / 0	5
	6639	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	6638	P1916F Group Division constructive algorithms dfs and similar graphs greedy *2900	0 / 0	10
	6637	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	6636	P1916H1 Matrix Rank (Easy Version) brute force combinatorics dp math matrices *2700	0 / 0	10
	6635	P1916H2 Matrix Rank (Hard Version) combinatorics dp math matrices string suffix structures *2700	0 / 0	10
	6634	P1917A Least Product constructive algorithms math *800	0 / 0	3
	6633	P1917B Erase First or Second Letter brute force combinatorics data structures dp strings *1100	0 / 0	3
	6632	P1917C Watering an Array brute force greedy implementation math *1600	0 / 0	5
	6631	P1917D Yet Another Inversions Problem combinatorics data structures dp implementation math number theory *2300	0 / 0	8
	6630	P1917E Construct Matrix constructive algorithms math *2500	0 / 0	9
	6629	P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	8207	P1918A Brick Wall constructive algorithms greedy implementation math *800	0 / 0	3
	8206	P1918B Minimize Inversions constructive algorithms data structures greedy implementation sortings *900	0 / 0	3
	8205	P1918C XOR-distance bitmasks dp greedy implementation math *1400	0 / 0	4
	8204	P1918D Blocking Elements binary search data structures dp implementation two pointers *1900	0 / 0	6
	8203	P1918E ace5 and Task Order constructive algorithms divide and conquer implementation interactive math probabilities sortings *2200	0 / 0	8
	8202	P1918F Caterpillar on a Tree data structures dfs and similar dp graphs greedy implementation sortings trees *2500	0 / 0	9
	8201	P1918G Permutation of Given constructive algorithms math *2700	0 / 0	10
	7325	P1919A Wallet Exchange greedy math *800	0 / 0	3
	7324	P1919B Plus-Minus Split greedy *800	0 / 0	3
	7323	P1919C Grouping Increases data structures dp greedy *1400	0 / 0	4
	7322	P1919D 01 Tree constructive algorithms data structures divide and conquer dp dsu greedy implementation sortings trees *2100	0 / 0	7
	7321	P1919E Counting Prefixes combinatorics constructive algorithms dp math *2600	0 / 0	10
	7320	P1919F1 Wine Factory (Easy Version) data structures *2300	0 / 0	8
	7319	P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	7318	P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 0	10
	7317	P1919H Tree Diameter interactive trees *3500	0 / 0	10
	8200	P1920A Satisfying Constraints brute force greedy math *800	0 / 0	3
	8199	P1920B Summation Game games greedy math sortings *1100	0 / 0	3
	8198	P1920C Partitioning the Array brute force math number theory *1600	0 / 0	5
	8197	P1920D Array Repetition binary search brute force dsu implementation math *1900	0 / 0	6
	8196	P1920E Counting Binary Strings combinatorics dp math *2100	0 / 0	7
	8195	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8194	P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	8193	P1921A Square greedy math *800	0 / 0	3
	8192	P1921B Arranging Cats greedy implementation *800	0 / 0	3
	8191	P1921C Sending Messages greedy math *900	0 / 0	3
	8190	P1921D Very Different Array data structures greedy sortings two pointers *1100	0 / 0	3
	8189	P1921E Eat the Chip brute force games greedy math *1600	0 / 0	5
	8188	P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	8187	P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	8186	P1922A Tricky Template constructive algorithms implementation strings *800	0 / 0	3
	8185	P1922B Forming Triangles combinatorics constructive algorithms math sortings *1200	0 / 0	4
	8184	P1922C Closest Cities greedy implementation math *1300	0 / 0	4
	8183	P1922D Berserk Monsters brute force data structures dsu implementation math *1900	0 / 0	6
	8182	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6
	8181	P1922F Replace on Segment dp graph matchings *2500	0 / 0	9
	8930	P1923A Moving Chips greedy implementation	0 / 0	(None)
	8929	P1923B Monsters Attack! dp greedy implementation	0 / 0	(None)
	8928	P1923C Find B constructive algorithms greedy	0 / 0	(None)
	8927	P1923D Slimes binary search constructive algorithms data structures greedy two pointers	0 / 0	(None)
	8926	P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(None)
	8925	P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings	0 / 0	(None)
	8180	P1924A Did We Get Everything Covered? constructive algorithms dp greedy shortest paths strings *1500	0 / 0	5
	8179	P1924B Space Harbour data structures implementation math sortings *2100	0 / 0	7
	8178	P1924C Fractal Origami geometry math matrices *2400	0 / 0	9
	8177	P1924D Balanced Subsequences combinatorics dp math *2700	0 / 0	10
	8176	P1924E Paper Cutting Again combinatorics probabilities *3100	0 / 0	10
	8175	P1924F Anti-Proxy Attendance constructive algorithms dp interactive ternary search *3500	0 / 0	10
	8174	P1925A We Got Everything Covered! constructive algorithms greedy strings *800	0 / 0	3
	8173	P1925B A Balanced Problemset? brute force greedy math number theory *1200	0 / 0	4
	8172	P1925D Good Trip combinatorics dp math probabilities *1900	0 / 0	6
	8924	P1926A Vlad and the Best of Five implementation	0 / 0	(None)
	8923	P1926B Vlad and Shapes geometry implementation	0 / 0	(None)
	8922	P1926C Vlad and a Sum of Sum of Digits dp implementation	0 / 0	(None)
	8921	P1926D Vlad and Division bitmasks greedy	0 / 0	(None)
	8920	P1926E Vlad and an Odd Ordering binary search bitmasks data structures dp implementation math number theory	0 / 0	(None)
	8919	P1926F Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation	0 / 0	(None)
	8918	P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	8917	P1927A Make it White greedy strings *800	0 / 0	3
	8916	P1927B Following the String constructive algorithms greedy strings *900	0 / 0	3
	8915	P1927C Choose the Different Ones! brute force greedy math *1000	0 / 0	3
	8914	P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	8913	P1927E Klever Permutation constructive algorithms math two pointers *1400	0 / 0	4
	8912	P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	8911	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
	8910	P1928A Rectangle Cutting geometry math *800	0 / 0	3

Pick a problem randomly based on the current filter.