*2100 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	476	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(None)
	443	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(None)
	376	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	(None)
	299	P1593F Red-Black Number dfs and similar dp implementation math meet-in-the-middle *2100	0 / 0	(None)
	286	P1598E Staircases brute force combinatorics data structures dfs and similar dp implementation math *2100	0 / 0	(None)
	276	P1599H Hidden Fortress interactive math *2100	0 / 0	(None)
	251	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(None)
	244	P1606E Arena combinatorics dp math *2100	0 / 0	(None)
	186	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	(None)
	136	P1621D The Winter Hike constructive algorithms greedy math *2100	0 / 0	(None)
	103	P1626D Martial Arts Tournament binary search brute force greedy math *2100	0 / 0	(None)
	91	P1628D1 Game on Sum (Easy Version) combinatorics dp games math *2100	0 / 0	(None)
	49	P1637E Best Pair binary search brute force implementation *2100	0 / 0	(None)
	7622	P1654D Potion Brewing Class dfs and similar math number theory trees *2100	0 / 0	(None)
	7678	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	(None)
	7831	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	(None)
	7924	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	8036	P1732C2 Sheikh (Hard Version) binary search bitmasks brute force greedy implementation two pointers *2100	0 / 0	7
	8061	P1748D ConstructOR bitmasks combinatorics constructive algorithms dp math number theory *2100	0 / 0	7
	8146	P1767C Count Binary Strings data structures dp *2100	0 / 0	7

Pick a problem randomly based on the current filter.