690 道题

ID 题目 显示标签 隐藏标签 AC / 尝试 难度
7955 P1714F   Build a Tree and That Is It 0 / 0 6
7954 P1714G   Path Prefixes 0 / 0 5
7994 P1718D   Permutation for Burenka 0 / 0 10
7985 P1720D1   Xor-Subsequence (easy version) 0 / 0 6
7984 P1720D2   Xor-Subsequence (hard version) 0 / 0 9
7978 P1721E   Prefix Function Queries 0 / 0 8
8047 P1725E   Electrical Efficiency 0 / 0 9
8043 P1725I   Imitating the Key Tree 0 / 0 10
8042 P1725J   Journey 0 / 0 9
8035 P1726D   Edge Split 0 / 0 7
8064 P1738D   Permutation Addicts 0 / 0 6
8062 P1738F   Connectivity Addicts 0 / 0 9
8056 P1739D   Reset K Edges 0 / 0 (无)
8187 P1740E   Hanging Hearts 0 / 0 6
8184 P1740H   MEX Tree Manipulation 0 / 0 10
8179 P1741D   Masha and a Beautiful Tree 0 / 0 4
8151 P1746D   Paths on the Tree 0 / 0 6
8137 P1748E   Yet Another Array Counting Problem 0 / 0 8
8130 P1749F   Distance to the Path 0 / 0 10
8272 P1761E   Make It Connected 0 / 0 9

分类

试试手气

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

  1. 关于
  2. 联系我们
  3. 隐私
  4. 服务条款
  5. Language
  6. Theme
  2. 京ICP备2021032661号-1
  3. 京公网安备 11011102002149号
  4. © 2021-2025 Hydro.ac
  6. Powered by Hydro v5.0.0-beta.13