*2300 - 题库 - 猫猫星の守望

ID	题目显示标签隐藏标签	AC / 尝试	难度
8342	P1927G Paint Charges data structures dp greedy math *2300	0 / 0	8
8337	P1928E Modular Sequence brute force constructive algorithms dp graphs greedy math number theory *2300	0 / 0	8
8331	P1929E Sasha and the Happy Tree Cutting bitmasks brute force dfs and similar dp graphs greedy math trees *2300	0 / 0	8
8330	P1929F Sasha and the Wedding Binary Search Tree brute force combinatorics data structures dfs and similar math trees *2300	0 / 0	8
8430	P1943C Tree Compass constructive algorithms dfs and similar greedy trees *2300	0 / 0	8
8612	P1965C Folding Strip constructive algorithms greedy strings *2300	0 / 0	8
8603	P1967C Fenwick Tree bitmasks brute force combinatorics data structures dp math trees *2300	0 / 0	8
8579	P1970B3 Exact Neighbours (Hard) constructive algorithms *2300	0 / 0	8
8569	P1970F1 Playing Quidditch (Easy) implementation *2300	0 / 0	8
8568	P1970F2 Playing Quidditch (Medium) implementation *2300	0 / 0	8
8567	P1970F3 Playing Quidditch (Hard) implementation *2300	0 / 0	8
8522	P1977D XORificator bitmasks brute force greedy hashing *2300	0 / 0	8
8673	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation *2300	0 / 0	8
8667	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
8630	P1995D Cases bitmasks brute force dp strings *2300	0 / 0	8

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

分类