题库 - *1300 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8469	codeforces#P1585C Minimize Distance greedy *1300	0 / 0	4
	7383	codeforces#P1594E1 Rubik's Cube Coloring (easy version) combinatorics math *1300	0 / 0	4
	7455	codeforces#P1603A Di-visible Confusion constructive algorithms math number theory *1300	0 / 0	4
	7460	codeforces#P1607D Blue-Red Permutation greedy math sortings *1300	0 / 0	4
	7836	codeforces#P1667A Make it Increasing brute force greedy math *1300	0 / 0	(无)
	7821	codeforces#P1669H Maximal AND bitmasks greedy math *1300	0 / 0	(无)
	7996	codeforces#P1693A Directional Increase greedy *1300	0 / 0	(无)
	8157	codeforces#P1717C Madoka and Formal Statement greedy *1300	0 / 0	4
	8252	codeforces#P1746C Permutation Operations constructive algorithms greedy implementation math *1300	1 / 4	4
	8921	codeforces#P1776H Beppa and SwerChat two pointers *1300	0 / 0	(无)
	8659	codeforces#P1810C Make It Permutation brute force greedy sortings *1300	0 / 0	4
	8700	codeforces#P1815A Ian and Array Sorting greedy math *1300	0 / 0	4
	8726	codeforces#P1823C Strongly Composite greedy math number theory *1300	0 / 0	4
	9065	codeforces#P1873F Money Trees binary search greedy math two pointers *1300	1 / 1	4
	9053	codeforces#P1879C Make it Alternating combinatorics dp greedy *1300	0 / 0	4
	9214	codeforces#P1902C Insert and Equalize brute force constructive algorithms greedy math number theory *1300	0 / 0	4
	9286	codeforces#P1913C Game with Multiset binary search bitmasks brute force greedy *1300	0 / 0	4
	9269	codeforces#P1915E Romantic Glasses data structures greedy math *1300	0 / 0	4
	9383	codeforces#P1927D Find the Different Ones! binary search brute force data structures dp dsu greedy two pointers *1300	1 / 2	4
	9354	codeforces#P1931D Divisible Pairs combinatorics math number theory *1300	1 / 1	4
	9604	codeforces#P1955C Inhabitant of the Deep Sea greedy implementation math *1300	0 / 0	4

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