*2500 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	8558	P1834F Typewriter brute force math *2500	0 / 0	9
	8556	P1835B Lottery binary search brute force greedy math two pointers *2500	0 / 0	9
	8544	P1842F Tenzing and Tree dfs and similar greedy shortest paths sortings trees *2500	0 / 0	9
	8520	P1845E Boxes and Balls dp implementation math *2500	0 / 0	9
	8627	P1854C Expected Destruction combinatorics dp math probabilities *2500	0 / 0	9
	8604	P1858E1 Rollbacks (Easy Version) brute force data structures dfs and similar trees *2500	0 / 0	9
	8598	P1859E Maximum Monogonosity brute force dp math *2500	0 / 0	9
	8826	P1903D2 Maximum And Queries (hard version) binary search bitmasks divide and conquer dp greedy *2500	0 / 0	9
	8824	P1903F Babysitting 2-sat binary search data structures graphs trees *2500	0 / 0	9
	8969	P1909F2 Small Permutation Problem (Hard Version) combinatorics dp math *2500	0 / 0	9
	8930	P1917E Construct Matrix constructive algorithms math *2500	0 / 0	9
	8929	P1917F Construct Tree bitmasks constructive algorithms dp trees *2500	0 / 0	9
	8999	P1920F1 Smooth Sailing (Easy Version) binary search brute force data structures dfs and similar dsu graphs shortest paths *2500	0 / 0	9
	8985	P1922F Replace on Segment dp graph matchings *2500	0 / 0	9
	9093	P1945G Cook and Porridge binary search constructive algorithms data structures implementation *2500	0 / 0	9
	9086	P1946F Nobody is needed brute force data structures dp math *2500	0 / 0	9
	9080	P1948F Rare Coins combinatorics math probabilities *2500	0 / 0	9
	9252	P1951F Inversion Composition constructive algorithms data structures greedy *2500	0 / 0	9
	9220	P1956E1 Nene vs brute force implementation math *2500	0 / 0	9
	9300	P1973E Cat, Fox and Swaps graphs math sortings *2500	0 / 0	9

Pick a problem randomly based on the current filter.