8621 道题

ID 题目 显示标签 隐藏标签 AC / 尝试 难度
8606 P1965D   Missing Subarray Sum 0 / 0 10
8605 P1965E   Connected Cubes 0 / 0 10
8604 P1965F   Conference 0 / 0 10
8603 P1966A   Card Exchange 0 / 0 3
8602 P1966B   Rectangle Filling 0 / 0 3
8601 P1967A   Permutation Counting 0 / 0 4
8600 P1967B1   Reverse Card (Easy Version) 0 / 0 4
8599 P1967B2   Reverse Card (Hard Version) 0 / 0 8
8598 P1967C   Fenwick Tree 0 / 0 8
8597 P1967D   Long Way to be Non-decreasing 0 / 0 10
8596 P1967E1   Again Counting Arrays (Easy Version) 0 / 0 10
8595 P1967E2   Again Counting Arrays (Hard Version) 0 / 0 10
8594 P1967F   Next and Prev 0 / 0 10
8593 P1968A   Maximize? 0 / 0 3
8592 P1968B   Prefiquence 0 / 0 3
8591 P1968C   Assembly via Remainders 0 / 0 3
8590 P1968D   Permutation Game 0 / 0 4
8589 P1968E   Cells Arrangement 0 / 0 5
8588 P1968F   Equal XOR Segments 0 / 0 6
8587 P1968G1   Division + LCP (easy version) 0 / 0 6

分类

试试手气

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

  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