bitmasks - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8930	P1980G Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs hashing strings trees	0 / 0	(无)
	8928	P1981B Turtle and an Infinite Sequence bitmasks math	0 / 0	(无)
	8927	P1981C Turtle and an Incomplete Sequence bitmasks brute force constructive algorithms greedy implementation math	0 / 0	(无)
	8998	P1982E Number of k-good subarrays bitmasks combinatorics data structures divide and conquer dp math meet-in-the-middle	0 / 0	(无)
	9048	P1983F array-value binary search bitmasks data structures greedy two pointers *2500	0 / 0	9
	9045	P1983G Your Loss bitmasks brute force dp trees *3000	0 / 0	10
	8966	P1985G D-Function bitmasks combinatorics math number theory	0 / 0	(无)
	9033	P1988C Increasing Sequence with Fixed OR bitmasks constructive algorithms greedy	0 / 0	(无)
	9085	P1990D Grid Puzzle bitmasks brute force dp greedy implementation *1800	0 / 0	6
	9080	P1991B AND Reconstruction bitmasks constructive algorithms greedy	0 / 0	(无)
	9078	P1991D Prime XOR Coloring bitmasks constructive algorithms graphs greedy math number theory	0 / 0	(无)
	9074	P1991H Prime Split Game bitmasks fft games math number theory	0 / 0	(无)
	9091	P1993E Xor-Grid Problem bitmasks dp	0 / 0	(无)
	9015	P1994B Fun Game bitmasks constructive algorithms greedy math	0 / 0	(无)
	9012	P1994E Wooden Game bitmasks greedy math trees	0 / 0	(无)
	9010	P1994G Minecraft bitmasks brute force dp math	0 / 0	(无)
	9068	P1995D Cases bitmasks brute force dp strings *2300	0 / 0	8

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