*2300 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8150	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8169	P1781E Rectangle Shrinking binary search brute force data structures greedy implementation two pointers *2300	0 / 0	8
	8195	P1790G Tokens on Graph constructive algorithms dfs and similar graphs shortest paths *2300	0 / 0	8
	8496	P1824B2 LuoTianyi and the Floating Islands (Hard Version) combinatorics dfs and similar math probabilities trees *2300	0 / 0	8
	8559	P1834E MEX of LCM binary search data structures implementation math number theory *2300	0 / 0	8
	8545	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	8534	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	8632	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers *2300	0 / 0	8
	8744	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8951	P1914G2 Light Bulbs (Hard Version) combinatorics data structures dfs and similar dp graphs hashing *2300	0 / 0	8
	8939	P1916E Happy Life in University data structures dfs and similar greedy trees *2300	0 / 0	8
	8931	P1917D Yet Another Inversions Problem combinatorics data structures dp implementation math number theory *2300	0 / 0	8
	8923	P1919F1 Wine Factory (Easy Version) data structures greedy *2300	0 / 0	8
	9048	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
	9043	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
	9037	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
	9036	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
	9107	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	9225	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8
	9208	P1965C Folding Strip constructive algorithms greedy strings *2300	0 / 0	8

Pick a problem randomly based on the current filter.