*2800 - 题库 - CZOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1231	P1578K Kingdom of Islands brute force graphs implementation *2800	0 / 0	10
	1174	P1592F2 Alice and Recoloring 2 constructive algorithms flows graph matchings greedy *2800	0 / 0	10
	1111	P1606F Tree Queries brute force dp trees *2800	0 / 0	10
	1098	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	10
	1090	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	10
	1065	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	10
	1046	P1615F LEGOndary Grandmaster combinatorics dp math *2800	0 / 0	10
	1009	P1620F Bipartite Array dp greedy *2800	0 / 0	10
	975	P1625E2 Cats on the Upgrade (hard version) binary search data structures dfs and similar graphs trees *2800	0 / 0	10
	969	P1626F A Random Code Problem combinatorics dp math number theory probabilities *2800	0 / 0	10
	934	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	10
	922	P1635F Closest Pair data structures greedy *2800	0 / 0	10
	867	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	10
	844	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	10
	726	P1672F2 Checker for Array Shuffling constructive algorithms dfs and similar graphs *2800	0 / 0	10
	654	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	10
	649	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	10
	606	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	582	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	10
	576	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	10
	432	P1721F Matching Reduction brute force constructive algorithms dfs and similar flows graph matchings graphs interactive *2800	0 / 0	10
	416	P1725I Imitating the Key Tree combinatorics dsu trees *2800	0 / 0	10
	371	P1732E Location data structures dp math number theory *2800	0 / 0	10
	282	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	10
	264	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	187	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	176	P1766F MCF flows *2800	0 / 0	10
	143	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	118	P1776D Teamwork constructive algorithms greedy math *2800	0 / 0	10
	66	P1783G Weighed Tree Radius data structures divide and conquer implementation trees *2800	0 / 0	10
	8516	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	8510	P1810F M-tree data structures math trees *2800	0 / 0	10
	8634	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	10
	8688	P1830D Mex Tree brute force dp trees *2800	0 / 0	10
	8721	P1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	10
	8706	P1845F Swimmers in the Pool dp fft math number theory *2800	0 / 0	10
	8755	P1852D Miriany and Matchstick constructive algorithms dp greedy *2800	0 / 0	10
	8851	P1900F Local Deletions binary search data structures implementation *2800	0 / 0	10
	8828	P1906D Spaceship Exploration binary search geometry *2800	0 / 0	10
	8966	P1943D2 Counting Is Fun (Hard Version) combinatorics dp *2800	0 / 0	10
	9107	P1967D Long Way to be Non-decreasing binary search dfs and similar graphs implementation shortest paths two pointers *2800	0 / 0	10

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