*2300 - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8075	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	8162	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	8235	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8361	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	8363	P1842E Tenzing and Triangle data structures dp geometry greedy math *2300	0 / 0	8
	8344	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	8542	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	8543	P1861E Non-Intersecting Subpermutations combinatorics dp implementation math *2300	0 / 0	8
	8508	P1864F Exotic Queries data structures implementation sortings *2300	0 / 0	8
	8497	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	8498	P1866D Digital Wallet dp greedy *2300	0 / 0	8
	8491	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	8492	P1866I Imagination Castle dp games two pointers *2300	0 / 0	8
	8454	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8455	P1870E Another MEX Problem bitmasks brute force dp shortest paths *2300	0 / 0	8
	8832	P1942E Farm Game combinatorics games *2300	0 / 0	8
	8826	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
	8748	P1955H The Most Reckless Defense bitmasks brute force constructive algorithms dp flows graph matchings shortest paths *2300	0 / 0	8
	8890	P1965C Folding Strip constructive algorithms greedy strings *2300	0 / 0	8
	8939	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
	9047	P1983E I Love Balls combinatorics math probabilities *2300	0 / 0	8
	9025	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
	9068	P1995D Cases bitmasks brute force dp strings *2300	0 / 0	8

根据当前过滤条件随机选择一道题