Problem Set - *2000 - SAST OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	384	P1827B1 Range Sorting (Easy Version) binary search dp dsu greedy trees two pointers *2000	0 / 0	7
	367	P1830B The BOSS Can Count Pairs brute force math *2000	0 / 0	7
	304	P1841D Pairs of Segments data structures greedy sortings two pointers *2000	0 / 0	7
	230	P1851G Vlad and the Mountains binary search data structures dsu graphs implementation sortings trees two pointers *2000	0 / 0	7
	200	P1857G Counting Graphs combinatorics divide and conquer dsu graphs greedy sortings trees *2000	0 / 0	7
	169	P1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	7
	133	P1867E1 Salyg1n and Array (simple version) constructive algorithms interactive math *2000	0 / 0	7
	107	P1872G Replace With Product brute force greedy math *2000	0 / 0	7
	60	P1881G Anya and the Mysterious String binary search data structures *2000	0 / 0	7
	27	P1889C1 Doremy's Drying Plan (Easy Version) brute force data structures dp greedy sortings *2000	0 / 0	7
	15	P1891F A Growing Tree data structures dfs and similar trees *2000	0 / 0	7
	12	P1893C Freedom of Choice brute force greedy implementation *2000	0 / 0	7
	5346	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	5338	P1903E Geo Game constructive algorithms dp games greedy interactive math *2000	0 / 0	7
	6700	P1905D Cyclic MEX data structures implementation math two pointers *2000	0 / 0	7
	6614	P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	6682	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7
	6676	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	8882	P1931G One-Dimensional Puzzle combinatorics math number theory *2000	0 / 0	7
	9382	P1958F Narrow Paths special problem combinatorics 2000	0 / 0	7
	9334	P1970E2 Trails (Medium) dp matrices *2000	0 / 0	7
	9304	P1974G Money Buys Less Happiness Now data structures greedy sortings *2000	0 / 0	7

Pick a problem randomly based on the current filter.