Problem Set - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	6634	codeforces#P1917A Least Product constructive algorithms math *800	0 / 0	3
	6633	codeforces#P1917B Erase First or Second Letter brute force combinatorics data structures dp strings *1100	0 / 0	3
	6632	codeforces#P1917C Watering an Array brute force greedy implementation math *1600	0 / 0	5
	6631	codeforces#P1917D Yet Another Inversions Problem combinatorics data structures dp implementation math number theory *2300	0 / 0	8
	6630	codeforces#P1917E Construct Matrix constructive algorithms math *2500	0 / 0	9
	6629	codeforces#P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	8207	codeforces#P1918A Brick Wall constructive algorithms greedy implementation math *800	0 / 0	3
	8206	codeforces#P1918B Minimize Inversions constructive algorithms data structures greedy implementation sortings *900	0 / 0	3
	8205	codeforces#P1918C XOR-distance bitmasks dp greedy implementation math *1400	0 / 0	4
	8204	codeforces#P1918D Blocking Elements binary search data structures dp implementation two pointers *1900	0 / 0	6
	8203	codeforces#P1918E ace5 and Task Order constructive algorithms divide and conquer implementation interactive math probabilities sortings *2200	0 / 0	8
	8202	codeforces#P1918F Caterpillar on a Tree data structures dfs and similar dp graphs greedy implementation sortings trees *2500	0 / 0	9
	8201	codeforces#P1918G Permutation of Given constructive algorithms math *2700	0 / 0	10
	7325	codeforces#P1919A Wallet Exchange greedy math *800	0 / 0	3
	7324	codeforces#P1919B Plus-Minus Split greedy *800	0 / 0	3
	7323	codeforces#P1919C Grouping Increases data structures dp greedy *1400	0 / 0	4
	7322	codeforces#P1919D 01 Tree constructive algorithms data structures divide and conquer dp dsu greedy implementation sortings trees *2100	0 / 0	7
	7321	codeforces#P1919E Counting Prefixes combinatorics constructive algorithms dp math *2600	0 / 0	10
	7320	codeforces#P1919F1 Wine Factory (Easy Version) data structures *2300	0 / 0	8
	7319	codeforces#P1919F2 Wine Factory (Hard Version) data structures dp flows greedy matrices *2800	0 / 0	10
	7318	codeforces#P1919G Tree LGM constructive algorithms divide and conquer games trees *3500	0 / 0	10
	7317	codeforces#P1919H Tree Diameter interactive trees *3500	0 / 0	10
	8200	codeforces#P1920A Satisfying Constraints brute force greedy math *800	0 / 0	3
	8199	codeforces#P1920B Summation Game games greedy math sortings *1100	0 / 0	3
	8198	codeforces#P1920C Partitioning the Array brute force math number theory *1600	0 / 0	5
	8197	codeforces#P1920D Array Repetition binary search brute force dsu implementation math *1900	0 / 0	6
	8196	codeforces#P1920E Counting Binary Strings combinatorics dp math *2100	0 / 0	7
	8195	codeforces#P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8194	codeforces#P1920F2 Smooth Sailing (Hard Version) binary search data structures dsu geometry graphs trees *3000	0 / 0	10
	8193	codeforces#P1921A Square greedy math *800	0 / 0	3
	8192	codeforces#P1921B Arranging Cats greedy implementation *800	0 / 0	3
	8191	codeforces#P1921C Sending Messages greedy math *900	0 / 0	3
	8190	codeforces#P1921D Very Different Array data structures greedy sortings two pointers *1100	0 / 0	3
	8189	codeforces#P1921E Eat the Chip brute force games greedy math *1600	0 / 0	5
	8188	codeforces#P1921F Sum of Progression brute force data structures dp implementation math *1900	0 / 0	6
	8187	codeforces#P1921G Mischievous Shooter brute force data structures divide and conquer dp implementation *2200	0 / 0	8
	8186	codeforces#P1922A Tricky Template constructive algorithms implementation strings *800	0 / 0	3
	8185	codeforces#P1922B Forming Triangles combinatorics constructive algorithms math sortings *1200	0 / 0	4
	8184	codeforces#P1922C Closest Cities greedy implementation math *1300	0 / 0	4
	8183	codeforces#P1922D Berserk Monsters brute force data structures dsu implementation math *1900	0 / 0	6
	8182	codeforces#P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer greedy math *1800	0 / 0	6
	8181	codeforces#P1922F Replace on Segment dp graph matchings *2500	0 / 0	9
	8930	codeforces#P1923A Moving Chips greedy implementation	0 / 0	(None)
	8929	codeforces#P1923B Monsters Attack! dp greedy implementation	0 / 0	(None)
	8928	codeforces#P1923C Find B constructive algorithms greedy	0 / 0	(None)
	8927	codeforces#P1923D Slimes binary search constructive algorithms data structures greedy two pointers	0 / 0	(None)
	8926	codeforces#P1923E Count Paths data structures dfs and similar dp dsu graphs trees	0 / 0	(None)
	8925	codeforces#P1923F Shrink-Reverse binary search brute force greedy hashing implementation string suffix structures strings	0 / 0	(None)
	8180	codeforces#P1924A Did We Get Everything Covered? constructive algorithms dp greedy shortest paths strings *1500	0 / 0	5
	8179	codeforces#P1924B Space Harbour data structures implementation math sortings *2100	0 / 0	7
	8178	codeforces#P1924C Fractal Origami geometry math matrices *2400	0 / 0	9
	8177	codeforces#P1924D Balanced Subsequences combinatorics dp math *2700	0 / 0	10
	8176	codeforces#P1924E Paper Cutting Again combinatorics probabilities *3100	0 / 0	10
	8175	codeforces#P1924F Anti-Proxy Attendance constructive algorithms dp interactive ternary search *3500	0 / 0	10
	8174	codeforces#P1925A We Got Everything Covered! constructive algorithms greedy strings *800	0 / 0	3
	8173	codeforces#P1925B A Balanced Problemset? brute force greedy math number theory *1200	0 / 0	4
	8172	codeforces#P1925D Good Trip combinatorics dp math probabilities *1900	0 / 0	6
	8924	codeforces#P1926A Vlad and the Best of Five implementation	0 / 0	(None)
	8923	codeforces#P1926B Vlad and Shapes geometry implementation	0 / 0	(None)
	8922	codeforces#P1926C Vlad and a Sum of Sum of Digits dp implementation	0 / 0	(None)
	8921	codeforces#P1926D Vlad and Division bitmasks greedy	0 / 0	(None)
	8920	codeforces#P1926E Vlad and an Odd Ordering binary search bitmasks data structures dp implementation math number theory	0 / 0	(None)
	8919	codeforces#P1926F Vlad and Avoiding X bitmasks brute force dfs and similar dp implementation	0 / 0	(None)
	8918	codeforces#P1926G Vlad and Trouble at MIT dfs and similar dp flows graphs greedy implementation trees	0 / 0	(None)
	8917	codeforces#P1927A Make it White greedy strings *800	0 / 0	3
	8916	codeforces#P1927B Following the String constructive algorithms greedy strings *900	0 / 0	3
	8915	codeforces#P1927C Choose the Different Ones! brute force greedy math *1000	0 / 0	3
	8914	codeforces#P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	0 / 0	4
	8913	codeforces#P1927E Klever Permutation constructive algorithms math two pointers *1400	0 / 0	4
	8912	codeforces#P1927F Microcycle data structures dfs and similar dsu graphs greedy implementation sortings trees *1900	0 / 0	6
	8911	codeforces#P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
	8910	codeforces#P1928A Rectangle Cutting geometry math *800	0 / 0	3
	8909	codeforces#P1928B Equalize binary search greedy sortings two pointers *1200	0 / 0	4
	8908	codeforces#P1928C Physical Education Lesson brute force math number theory *1600	0 / 0	5
	8907	codeforces#P1928D Lonely Mountain Dungeons brute force data structures greedy math ternary search *1900	0 / 0	6
	8906	codeforces#P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	8905	codeforces#P1928F Digital Patterns combinatorics data structures implementation math *2900	0 / 0	10
	8904	codeforces#P1929A Sasha and the Beautiful Array constructive algorithms greedy math sortings *800	0 / 0	3
	8903	codeforces#P1929B Sasha and the Drawing constructive algorithms greedy math *800	0 / 0	3
	8902	codeforces#P1929C Sasha and the Casino binary search brute force constructive algorithms games greedy math *1400	0 / 0	4
	8901	codeforces#P1929D Sasha and a Walk in the City combinatorics dp math trees *1900	0 / 0	6
	8900	codeforces#P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	8899	codeforces#P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	8898	codeforces#P1930A Maximise The Score greedy sortings	0 / 0	(None)
	8897	codeforces#P1930B Permutation Printing brute force constructive algorithms math	0 / 0	(None)
	8896	codeforces#P1930C Lexicographically Largest binary search constructive algorithms data structures greedy sortings	0 / 0	(None)
	8895	codeforces#P1930D1 Sum over all Substrings (Easy Version) brute force dp greedy strings	0 / 0	(None)
	8894	codeforces#P1930D2 Sum over all Substrings (Hard Version) bitmasks divide and conquer dp dsu greedy implementation strings	0 / 0	(None)
	8893	codeforces#P1930E 2..3...4... combinatorics dp math	0 / 0	(None)
	8892	codeforces#P1930F Maximize the Difference bitmasks brute force dfs and similar	0 / 0	(None)
	8891	codeforces#P1930G Prefix Max Set Counting data structures dp trees	0 / 0	(None)
	8890	codeforces#P1930H Interactive Mex Tree constructive algorithms dfs and similar interactive trees	0 / 0	(None)
	8889	codeforces#P1930I Counting Is Fun combinatorics	0 / 0	(None)
	8888	codeforces#P1931A Recovering a Small String brute force strings *800	0 / 0	3
	8887	codeforces#P1931B Make Equal greedy *800	0 / 0	3
	8886	codeforces#P1931C Make Equal Again brute force greedy math *1000	0 / 0	3
	8885	codeforces#P1931D Divisible Pairs combinatorics math number theory *1300	0 / 0	4
	8884	codeforces#P1931E Anna and the Valentine's Day Gift games greedy math sortings *1400	0 / 0	4
	8883	codeforces#P1931F Chat Screenshots combinatorics dfs and similar graphs *1700	0 / 0	5
	8882	codeforces#P1931G One-Dimensional Puzzle combinatorics math number theory *2000	0 / 0	7

Pick a problem randomly based on the current filter.