2,340

  • Codeforces Round #340 (Div. 2)-B. Chocolate(组合数学的乘法计数)
  • 【暴力搜索】【莫队算法】【贪心】[Codeforces Round #340 (Div. 2) ]题解报告
  • Codeforces Round #340 (Div. 2) E. XOR and Favorite Number(莫队算法)
  • Codeforces Round #340 (Div. 2) 617C Watering Flowers(计算几何)
  • Codeforces 617C Watering Flowers (Round #340 (Div. 2) C题) nlogn算法
  • Codeforces Round #340 (Div. 2) (618A,618B,618C)
  • Codeforces Round #340 (Div. 2) E. XOR and Favorite Number(分块 (java))
  • Codeforces Round #340 (Div. 2)E - XOR and Favorite Number(Mo's algorithm)
  • 莫队算法(CF #340 (Div. 2) E. XOR and Favorite Number)
  • Codeforces Round #340 (Div. 2)E-XOR and Favorite Number(莫队算法)
  • Codeforces Round #340 (Div. 2) 617E XOR and Favorite Number 莫队算法
  • Codeforces Round #340 (Div. 2) E XOR and Favorite Number(莫队)
  • Codeforces Round #340 (Div. 2) C. Watering Flowers(暴力枚举)
  • Codeforces Round #340 (Div. 2)E-XOR and Favorite Number(莫队算法)★ ★
  • Codeforces Round #340 (Div. 2) B. Chocolate 组合学、简单题
  • Codeforces Round #340 (Div. 2) C. Watering Flowers 计算几何、圆和点
  • Codeforces Round #340 (Div. 2) E. XOR and Favorite Number 莫队算法
  • Codeforces Round #340 (Div. 2)E. XOR and Favorite Number(莫队算法)
  • Codeforces Round #340 (Div. 2) E. XOR and Favorite Number —— 莫队算法
  • Codeforces Round #340 (Div. 2) E XOR and Favorite Number(莫队算法)
  • Codeforces Round #340 (Div. 2)-E-XOR and Favorite Number(莫队)
  • Codeforces Round #340 (Div. 2) E. XOR and Favorite Number【莫队算法】
  • Codeforces 617EXOR and Favorite Number (Round #340 (Div. 2) E题) 莫队算法 + 异或基本性质
  • 【Codeforces Round 340 (Div 2)B】【简单题】Chocolate 巧克力划分方案数 每段恰有一个坚果
  • 【Codeforces Round 340 (Div 2)D】【讨论题】Polyline 三点用最少数量连续不分叉线段连接
  • 340 - Master-Mind Hints
  • 340 - Master-Mind Hints
  • UVA 340 (13.07.27)
  • uva——340
  • 340 - Master-Mind Hints
  • UVA - 340 - Mind Hints
  • Codeforce 340D