119
102

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

More than 3 years have passed since last update.

AtCoder 問題カテゴリー分類

Last updated at Posted at 2019-09-23

AtCoder 問題カテゴリー分類

類題学習用に使う手法毎に AtCoder の問題を分類したものです. その手法で解けるというだけで、必ずしもそれを使用するのが最適というわけではないことに注意.

この記事は随時更新されます.

動的計画法 (Dynamic programming: DP)

累積和 (Prefix sum)

imos 法 (imos method)

座標圧縮 (Coordinate compression)

しゃくとり法 (Two pointer)

Sliding window

Union-find Forest / Disjoint-set data structure

深さ優先探索 (Depth-first search: DFS)

幅優先探索 (Breadth-first search: BFS)

01-BFS

ダイクストラ法 (Dijkstra's algorithm)

ダブリング (Doubling)

オイラーツアー (Euler Tour)

二分探索 (Binary search)

三分探索 (Ternary search) / 黄金分割探索

ビット全探索

半分全列挙 (Meet in the middle)

ワーシャルフロイド

優先度付きキュー (Priority queue)

素因数分解

約数列挙

エラトステネスの篩

剰余の乗法の逆元 (modular multiplicative inverse)

パスカルの三角形

区分木 (Segment tree)

Sparse table

Disjoint sparse table

Fenwick tree / Binary indexed tree: BIT

平衡二分探索木

119
102
1

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
119
102

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?