Playing AtCoder.
- gcc 12
| Contest | Problem | Memo |
|---|---|---|
| ABC167 | D - Teleporter | DP Doubling |
| typical90 | 012 - Red Painting（★4） | Union Find |
| atc001 | B - Union Find | Union Find |
| abc097 | D - Equals | Union Find |
| arc032 | B - 道路工事 | Union Find |
| abc049 | D - 連結 | Union Find |
| abc120 | D - Decayed Bridges | Union Find |
| abc157 | D - Friend Suggestions | Union Find |
| typical90 | 013 - Passing（★5） | Dijkstra |
| abc034 | C - 経路 | 二項係数 |
| abc185 | C - Duodecim Ferra | 二項係数 |
| typical90 | 015 - Don't be too close（★6） | 二項係数 |
| atc002 | B - n^p mod m | 繰返し二乗法 |
| abc167 | E - Colorful Blocks | 二項係数 |
| abc021 | D - 多重ループ | 二項係数 |
| agc025 | B - RGB Coloring | 二項係数, 素因数分解 |
| arc077 | D - 11 | 二項係数 |
| arc116 | C - Multiple Sequences | 二項係数, 素因数分解 |
| practice2 | B - Fenwick Tree | Binary Indexed Tree |
| abc038 | D - プレゼント | Binary Indexed Tree |
| abc036 | C - 座圧 | 座標圧縮 |
| abc113 | C - ID | 座標圧縮 |
| abc107 | B - Grid Compression | 座標圧縮 |
| abc213 | C - Reorder Cards | 座標圧縮 |
| abc231 | F - Jealous Two | 座標圧縮, Binary Indexed Tree |
| abc234 | D - Prefix K-th Max | Heap, Binary Indexed Tree |
| chokudai_S001 | J - 転倒数 | Binary Indexed Tree |
| abc185 | F - Range Xor Query | Binary Indexed Tree |
| arc033 | C - データ構造 | Binary Indexed Tree |
| abc035 | C - オセロ | 累積和, いもす法 |
| abc014 | C - AtColor | 累積和, いもす法 |
| abc138 | D - Ki | 累積和 |
| abc018 | C - 菱型カウント | 累積和, いもす法 |
| typical90 | 028 - Cluttered Paper（★4） | 累積和, いもす法 |
| nikkei2019-final | A - Abundant Resources | 累積和 |
| abc084 | D - 2017-like Number | 累積和, 素数 |
| agc023 | A - Zero-Sum Ranges | 累積和 |
| abc005 | D - おいしいたこ焼きの焼き方 | 累積和 |
| abc086 | D - Checker | 累積和 |
| abc032 | C - 列 | しゃくとり法 |
| abc038 | C - 単調増加 | しゃくとり法 |
| abc153 | F - Silver Fox vs Monster | いもす法 |
| arc022 | B - 細長いお菓子 | しゃくとり法 |
| abc098 | D - Xor Sum 2 | しゃくとり法 |
| abc017 | D - サプリメント | 累積和, しゃくとり法 |
| abc134 | C - Exception Handling | 累積和 |
| tkppc3 | D - 巨大チェスボード | 累積和 |
| abc122 | C - GeT AC | 累積和 |
| abc125 | C - GCD on Blackboard | 累積和 |
| abjoi2017yoc125 | C - 休憩スペース (Refreshment Area) | 累積和 |
| abc080 | D - Recording | 累積和 |
| bitflyer2018-qual | D - ハンコ | 累積和, いもす法, 座標圧縮 |
| arc077 | E - guruguru | 累積和, いもす法 |
| abc197 | C - ORXOR | bit |
| abc147 | D - Xor Sum 4 | bit |
| arc114 | A - Not coprime | bit, 素数 |
| abc194 | C - Squared Error | 主客転倒 |
| arc107 | A - Simple Math | 割り算 |
| arc111 | A - Simple Math 2 | 割り算 |
| abc110 | D - Factorization | 二項係数, 素因数分解 |
| arc004 | D - 表現の自由 ( Freedom of expression ) | 二項係数, 素因数分解 |
| caddi2018 | C - Product and GCD | 素因数分解 |
| arc110 | D - Binomial Coefficient is Fun | 二項係数 |
| arc107 | C - Shuffle Permutation | Union Find |
| arc004 | A - 2 点間距離の最大値 ( The longest distance ) | 数学 |
| abc168 | C - : (Colon) | 三角関数 |
| abc197 | D - Opposite | 三角関数 |
| abc144 | D - Water Bottle | 三角関数 |
| abc033 | D - 三角形の分類 | しゃくとり法 |
| abc273 | D - LRUD Instructions | 二分探索 |
| abc269 | E - Last Rook | 二分探索 |
| abc260 | D - Draw Your Cards | 二分探索 |
| abc255 | D - ±1 Operation 2 | 二分探索 |
| abc255 | C - ±1 Operation 1 | 二分探索 |
| abc254 | D - Together Square | 数学 |
| abc248 | D - Range Count Query | 二分探索 |
| abc246 | D - 2-variable Function | 二分探索 |
| abc246 | D - 2-variable Function | 二分探索 |
| practice2 | J - Segment Tree | Segment Tree |
| agc005 | B - Minimum Sum | 主客転倒, monotonic stack, Segment Tree |
| abc157 | E - Simple String Queries | Segment Tree |
| abc217 | D - Cutting Woods | Segment Tree, 座標圧縮 |
| arc008 | D - タコヤキオイシクナール | Segment Tree, 座標圧縮, 半環 |
| abc241 | D - Sequence Query | Segment Tree, 座標圧縮 |
| abc231 | C - Counting 2 | 二分探索 |
| abc228 | D - Linear Probing | 二分探索 |
| abc216 | E - Amusement Park | 二分探索 |
| abc208 | C - Fair Candy Distribution | 座標圧縮 |
| abc263 | C - Monotonically Increasing | itertools |
| abc232 | C - Graph Isomorphism | itertools |
| abc215 | C - One More aab aba baa | itertools |
| abc250 | D - 250-like Number | 素数 |
| abc215 | D - Coprime 2 | 素因数分解 |
| abc233 | C - Product | DFS |
| abc236 | D - Dance | DFS |
| abc213 | D - Takahashi Tour | DFS |
| abc284 | E - Count Simple Paths | DFS |
| abc240 | E - Ranges on Tree | DFS |
| abc239 | E - Subtree K-th Max | DFS |
| abc014 | D - 閉路 | Euler Tour, Segment Tree, LCA |
| abc284 | C - Count Connected Components | BFS |
| abc282 | D - Make Bipartite 2 | BFS |
| abc270 | C - Simple path | BFS |
| abc204 | C - Tour | BFS |
| abc276 | E - Round Trip | BFS |
| abc272 | D - Root M Leaper | BFS |
| abc269 | D - Do use hexagon grid | BFS |
| abc235 | D - Multiply and Rotate | BFS |
| abc232 | D - Weak Takahashi | BFS |
| abc211 | D - Number of Shortest paths | BFS |
| abc209 | D - Collision | BFS |
| abc253 | C - Max - Min Query | heap |
| abc223 | D - Restricted Permutation | heap |
| abc212 | D - Querying Multiset | heap |
| abc007 | C - 幅優先探索 | BFS |
| abc088 | D - Grid Repainting | BFS |
| abc077 | C - Snuke Festival | 二分探索 |
| arc005 | C - 器物損壊！高橋君 | BFS |
| abc176 | D - Wizard in Maze | BFS |
| arc061 | C - たくさんの数式 | bit |
| arc061 | E - すぬけ君の地下鉄旅行 | BFS, Dijkstra |
| abc277 | E - Crystal Switches | BFS, Dijkstra |
| abc217 | E - Sorting Queries | heap |
| abc077 | D - Small Multiple | BFS |
| abc246 | E - Bishop 2 | BFS |
| abc170 | F - Pond Skater | BFS |
| abc254 | E - Small d and k | BFS |
| abc257 | D - Jumping Takahashi 2 | BFS, 二分探索 |
| abc188 | E - Peddler | DP |
| abc244 | F - Shortest Good Path | DP, BFS |
| abc251 | F - Two Spanning Trees | DFS, BFS |
| abc248 | C - Dice Sum | DP, 包除原理 |
| abc245 | C - Choose Elements | DP |
| abc242 | C - 1111gal password | DP |
| abc211 | C - chokudai | DP |
| abc267 | D - Index × A(Not Continuous ver.) | DP |
| abc266 | D - Snuke Panic (1D) | DP |
| abc261 | D - Flipping and Bonus | DP |
| abc222 | D - Between Two Arrays | DP |
| abc219 | D - Strange Lunchbox | DP |
| abc204 | D - Cooking | DP |
| abc253 | E - Distance Sequence | DP, いもす法 |
| abc244 | E - King Bombee | DP |
| abc233 | D - Count Interval | 累積和 |
| abc229 | D - Longest X | 累積和, しゃくとり法 |
| abc265 | D - Iroha and Haiku (New ABC Edition) | 累積和, しゃくとり法 |
| abc285 | D - Change Usernames | Union Find |
| abc231 | D - Neighbors | Union Find |
| arc037 | B - バウムテスト | Union Find |
| abc226 | E - Just one | Union Find, Graph |
| arc106 | B - Values | Union Find |
| abc177 | D - Friends | Union Find |
| abc206 | D - KAIBUNsyo | Union Find |
| aising2019 | C - Alternating Path | Union Find |
| abc256 | E - Takahashi's Anguish | Union Find, Graph |
| abc216 | D - Pair of Balls | Topological Sort |
| abc259 | D - Circumferences | Union Find |
| abc229 | E - Graph Destruction | Union Find |
| abc218 | E - Destruction | Union Find |
| abc221 | C - Select Mul | bit |
| abc249 | C - Just K | bit |
| abc264 | C - Matrix Reducing | bit |
| abc229 | C - Cheese | greedy |
| abc012 | D - バスと避けられない運命 | Floyd-Warshall |
| abc079 | D - Wall | Floyd-Warshall |
| abc074 | D - Restoring Road Network | Floyd-Warshall |
| abc022 | C - Blue Bird | Floyd-Warshall |
| abc073 | D - joisino's travel | Floyd-Warshall |
| arc035 | C - アットコーダー王国の交通事情 | Floyd-Warshall |
| abc208 | D - Shortest Path Queries 2 | Floyd-Warshall |
| abc286 | E - Souvenir | Floyd-Warshall |
| typical-algorithm | B - 区間スケジューリング問題 | 区間スケジューリング |
| abc103 | D - Islands War | 区間スケジューリング |
| keyence2020 | B - Robot Arms | 区間スケジューリング |
| abc230 | D - Destroyer Takahashi | 区間スケジューリング |
| abc131 | D - Megalomania | 区間スケジューリング |
| arc106 | C - Solutions | 区間スケジューリング |
| abc003 | D - AtCoder 社の冬 | 包除原理 |
| abc253 | D - FizzBuzz Sum Hard | 包除原理 |
| arc054 | B - ムーアの法則 | 三分探索 |
| abc063 | D - Widespread | 二分探索 |
| abc279 | D - Freefall | 三分探索 |
| abc109 | C - Skip | 最大公約数 |
| abc148 | C - Snack | 最小公倍数 |
| abc070 | C - Multiple Clocks | 最小公倍数 |
| abc149 | C - Next Prime | 素数 |
| arc044 | A - 素数判定 | 素数 |
| abc112 | D - Partition | 約数全列挙 |
| abc156 | D - Bouquet | 割り算 |
| abc118 | C - Monsters Battle Royale | 最大公約数 |
| abc186 | E - Throne | 割り算 |
| abc154 | D - Dice in Line | 累積和 |
| agc028 | A - Two Abbreviations | 最大公約数 |
| abc075 | C - Bridge | Union Find |
| abc172 | E - NEQ | 二項係数, 包除原理 |
| abc178 | C - Ubiquity | 包除原理 |
| abc102 | D - Equal Cut | 累積和, しゃくとり法 |
| abc152 | F - Tree and Constraints | 包除原理, LCA |
| abc290 | D - Marking | 最大公約数 |
| practice2 | K - Range Affine Range Sum | Lazy Segment Tree |
| practice2 | L - Lazy Segment Tree | Lazy Segment Tree |
| nikkei2019-final | D - Deforestation | Lazy Segment Tree |
| abc130 | D - Enough Array | 累積和, しゃくとり法 |
| arc009 | C - 高橋君、24 歳 | 包除原理, 割り算 |
| tenka1-2019 | D - Three Colors | 包除原理, DP |
| abc151 | F - Enclose All | 幾何, 二分探索 |
| abc264 | E - Blackout 2 | Union Find |
| abc183 | F - Confluence | Union Find |
| abc087 | D - People on a Line | 重み付き Union-Find |
| abc280 | F - Pay or Receive | 重み付き Union-Find |
| abc190 | F - Shift and Inversions | Binary Indexed Tree |
| tessoku-book | A67 - MST (Minimum Spanning Tree) | Minimum Spanning Tree, Union-Find |
| tessoku-book | B67 - Max MST | Minimum Spanning Tree, Union-Find |
| abc065 | D - Built? | Minimum Spanning Tree, Union-Find |
| iroha2019-day2 | D - 楽しすぎる家庭菜園 | Minimum Spanning Tree, Union-Find |
| typical90 | 060 - Chimera（★5） | LIS |
| chokudai_S001 | H - LIS | LIS |
| abc134 | E - Sequence Decomposing | LIS |
| chokudai_S002 | L - 長方形 β | LIS |
| abc061 | D - Score Attack | Bellman-Ford |
| ttpc2015 | N - 何かグラフの問題 | Bellman-Ford |
| abc137 | E - Coins Respawn | Bellman-Ford |
| abc051 | D - Candidates of No Shortest Paths | Floyd-Warshall |
| joi2008yo | F - 船旅 | Dijkstra |
| abc035 | D - トレジャーハント | Dijkstra |
| abc095 | C - Half and Half | 全探索 |
| abc122 | B - ATCoder | 全探索 |
| pakencamp-2019-day3 | C - カラオケ | 全探索 |
| sumitrust2019 | D - Lucky PIN | 全探索 |
| s8pc-6 | B - AtCoder Market | 全探索 |
| joi2008yo | D - 星座探し | 全探索 |
| abc128 | C - Switches | bit 全探索 |
| abc002 | D - 派閥 | bit 全探索 |
| joi2008yo | E - おせんべい | bit 全探索 |
| s8pc-4 | B - Buildings are Colorful! | bit 全探索 |
| abc145 | C - Average Length | 順列全探索 |
| abc150 | C - Count Order | 順列全探索 |
| joi2009ho | B - ピザ | 二分探索 |
| abc023 | D - 射撃王 | 二分探索 |
| joi2009yo | D - 薄氷渡り | DFS |
| joi2011yo | E - チーズ (Cheese) | BFS |
| joi2012yo | E - イルミネーション (Illumination) | BFS |
| joi2011yo | D - 1 年生 (A First Grader) | DP |
| joi2012yo | D - パスタ (Pasta) | DP |
| joi2013yo | D - 暑い日々 (Hot days) | DP |
| joi2015yo | D - シルクロード (Silk Road) | DP |
| pakencamp-2019-day3 | D - パ研軍旗 | DP |
| dp | L - Deque | DP |
| dp | N - Slimes | DP |
| joi2015ho | B - ケーキの切り分け２ (Cake 2) | DP |
| tdpc | I - イウィ | DP |
| typical-algorithm | A - 二分探索の練習問題 | 二分探索 |
| typical-algorithm | D - 単一始点最短経路問題 | Dijkstra |
| typical-algorithm | E - 全点対最短経路問題 | Floyd-Warshall |
| typical-algorithm | F - 最小全域木問題 | Minimum Spanning Tree, Union-Find |
| typical-algorithm | C - 巡回セールスマン問題 | DP |
| abc180 | E - Traveling Salesman among Aerial Cities | DP |
| s8pc-1 | G - Revenge of Traveling Salesman Problem | DP |
| joi2014yo | D - 部活のスケジュール表 (Schedule) | DP |
| dp | O - Matching | DP |
| abc215 | E - Chain Contestant | DP |
| abc018 | D - バレンタインデー | 半分全列挙 |
| abc147 | C - HonestOrUnkind2 | bit 全探索 |
| dp | U - Grouping | DP, bit 全探索 |
| arc016 | C - ソーシャルゲーム | DP |
| abc062 | C - Chocolate Bar | 全探索 |
| abc032 | D - ナップサック問題 | DP, bit 全探索, 半分全列挙 |
| arc017 | C - 無駄なものが嫌いな人 | bit 全探索, 半分全列挙 |
| agc026 | C - String Coloring | bit 全探索, 半分全列挙 |
| abc054 | D - Mixing Experiment | bit 全探索, 半分全列挙 |
| abc184 | F - Programming Contest | bit 全探索, 半分全列挙 |
| joi2017yo | D - ぬいぐるみの整理 (Plush Toys) | DP |
| abc006 | D - トランプ挿入ソート | LIS |
| joi2016yo | E - ゾンビ島 (Zombie Island) | Dijkstra, BFS |
| joi2014yo | E - タクシー (Taxis) | Dijkstra, BFS |
| s8pc-1 | E - 散歩 (E869120 and Path Length) | べき乗 |
| abc145 | D - Knight | 割り算 |
| joi2011ho | A - 惑星探査 (Planetary Exploration) | 累積和 |
| abc106 | D - AtCoder Express 2 | 累積和 |
| gigacode-2019 | D - 家の建設 | 累積和 |
| joi2015ho | A - 鉄道旅行 (Railroad Trip) | 累積和, いもす法 |
| joi2013ho | 1 - 電飾 (Illumination) | Misc |
| s8pc-5 | B - Emblem | Misc |
| s8pc-3 | B - 石落としゲーム | Misc |
| abc149 | B - Greedy Takahashi | Greedy |
| abc139 | D - ModSum | Misc |
| abc150 | D - Semi Common Multiple | 最小公倍数 |
| sumitrust2019 | E - Colorful Hats 2 | Misc |
| ddcc2020-qual | D - Digit Sum Replace | Misc |
| tenka1-2018-beginner | D - Crossing | Misc |
| abc139 | E - League | Topological Sort |
| abc031 | D - 語呂合わせ | 全探索 |
| abc039 | D - 画像処理高橋君 | 全探索 |
| abc075 | D - Axis-Parallel Rectangle | 全探索 |
| abc004 | D - マーブル | 全探索 |
| abc008 | D - 金塊ゲーム | DP |
| abc015 | D - 高橋くんの苦悩 | DP |
| abc037 | D - 経路 | DP |
| abc056 | D - No Need | DP, 二分探索 |
| abc060 | D - Simple Knapsack | DP |
| abc007 | D - 禁止された数字 | 桁 DP |
| abc029 | D - 1 | 桁 DP |
| abc036 | D - 塗り絵 | 木 DP |
| abc041 | D - 徒競走 | DP |
| abc009 | D - 漸化式 | 行列累乗, 半環 |
| abc011 | D - 大ジャンプ | 確率 DP |
| abc024 | D - 動的計画法 | 数学 |
| abc028 | D - 乱数生成 | 数学 |
| abc057 | D - Maximum Average Sets | 数学 |
| abc026 | D - 高橋君ボール 1 号 | 二分探索 |
| abc034 | D - 食塩水 | 二分探索 |
| abc040 | D - 道路の老朽化対策について | Union Find |
| abc013 | D - 阿弥陀 | Doubling |
| abc016 | D - 一刀両断 | 幾何 |
| abc022 | D - Big Bang | 幾何 |
| abc027 | D - ロボット | Misc |
| abc062 | D - 3N Numbers | Heap |
| abc064 | D - Insertion | Misc |
| abc030 | D - へんてこ辞書 | Misc |
| practice2 | D - Maxflow | Max Flow |
| abc010 | D - 浮気予防 | Max Flow |
| sumitrust2019 | B - Tax Rate | Misc |
| m-solutions2020 | B - Magic 2 | 全探索 |
| abc105 | B - Cakes and Donuts | 全探索 |
| abc157 | C - Guess The Number | 全探索 |
| abc106 | B - 105 | 全探索 |
| abc136 | B - Uneven Numbers | 全探索 |
| abc068 | B - Break Number | 全探索 |
| abc133 | B - Good Distance | 全探索 |
| abc112 | C - Pyramid | 全探索 |
| abc057 | C - Digits in Multiplication | 全探索 |
| sumitrust2019 | C - 100 to 105 | 全探索 |
| abc089 | C - March | 全探索 |
| abc167 | C - Skill Up | bit 全探索 |
| abc054 | C - One-stroke Path | DFS |
| abc165 | C - Many Requirements | DFS |
| cpsco2019-s1 | C - Coins | DFS |
| panasonic2020 | D - String Equivalence | DFS |
| m-solutions2020 | E - M's Solution | bit 全探索 |
| wupc2019 | F - RPG | Max Flow |
| ddcc2019-final | D - DISCO! | Segment Tree, 半環 |
| code-thanks-festival-2017-open | H - Union Sets | 並列二分探索 |
| tokiomarine2020 | E - O(rand) | 包除原理 |
| dp | V - Subtree | 全方位木 DP |
| njpc2017 | E - 限界集落 | 全方位木 DP |
| s8pc-4 | D - Driving on a Tree | 全方位木 DP |
| arc029 | D - 高橋君と木のおもちゃ | 2 乗の木 DP |
| aising2019 | E - Attack to a Tree | 2 乗の木 DP |
| discovery2016-final | C - 特別講演「括弧列と塗り分け」 | 2 乗の木 DP |
| arc101 | E - Ribbons on Tree | 2 乗の木 DP, 包除原理 |
| arc085 | E - MUL | Max Flow |
| tenka1-2015-quala | C - 天下一美術館 | Max Flow |
| ttpc2015 | L - グラフ色ぬり | Max Flow |
| abc011 | C - 123 引き算 | DP |
| abc021 | C - 正直者の高橋くん | DFS |
| abc040 | C - 柱柱柱柱柱 | DP |
| abc044 | C - 高橋君とカード | DP |
| abc087 | C - Candies | DP |
| abc099 | C - Strange Bank | DP |
| abc122 | D - We Like AGC | DP |
| abc129 | C - Typical Stairs | DP |
| abc135 | D - Digits Parade | DP |
| abc141 | E - Who Says a Pun? | DP |
| abc142 | E - Get Everything | DP |
| abc145 | E - All-you-can-eat | DP |
| abc153 | E - Crested Ibis vs Monster | DP |
| abc154 | E - Almost Everywhere Zero | 桁 DP |
| abc175 | E - Picking Goods | DP |
| abc184 | D - increment of coins | DP |
| abc188 | F - +1-1x2 | DP |
| abc195 | E - Lucky 7 Battle | DP |
| abc201 | D - Game in Momotetsu World | minimax |
| abc210 | D - National Railway | DP |
| arc002 | C - コマンド入力 | DP |
| arc042 | C - おやつ | DP |
| agc044 | A - Pay to Win | DP |
| past201912-open | I - 部品調達 | DP |
| past202004-open | H - 1-9 Grid | DP |
| past202005-open | H - ハードル走 | DP |
| abc037 | C - 総和 | 累積和 |
| abc089 | D - Practical Skill Test | 累積和 |
| abc095 | D - Static Sushi | 累積和 |
| abc098 | C - Attention | 累積和 |
| abc104 | D - We Love ABC | 累積和 |
| abc124 | D - Handstand | 累積和, しゃくとり法 |
| abc129 | D - Lamp | 累積和 |
| abc149 | E - Handshake | 累積和, 二分探索 |
| abc162 | D - RGB Triplets | 累積和 |
| abc172 | C - Tsundoku | 累積和, 二分探索, しゃくとり法 |
| abc177 | C - Sum of product of pairs | 累積和 |
| abc181 | E - Transformable Teacher | 累積和, しゃくとり法 |
| abc182 | D - Wandering | 累積和 |
| arc025 | B - チョコレート | 累積和 |
| arc104 | B - DNA Sequence | 累積和 |
| agc015 | B - Evilator | Misc |
| abc017 | C - ハイスコア | いもす法 |
| abc024 | B - 自動ドア | いもす法 |
| abc141 | C - Attack Survival | いもす法 |
| abc183 | D - Water Heater | いもす法 |
| abc188 | D - Snuke Prime | いもす法 |
| abc210 | C - Colorful Candies | Sliding Window |
| abc126 | E - 1 or 2 | Union Find |
| abc189 | C - Mandarin Orange | Misc |
| abc214 | D - Sum of Maximum Weights | Union Find |
| arc111 | B - Reversible Cards | Union Find |
| atc001 | A - 深さ優先探索 | DFS |
| abc070 | D - Transit Tree Path | DFS |
| abc126 | D - Even Relation | DFS |
| abc146 | D - Coloring Edges on Tree | DFS |
| abc148 | F - Playing Tag on Tree | DFS |
| abc198 | E - Unique Color | DFS |
| arc022 | C - ロミオとジュリエット | DFS |
| arc030 | B - ツリーグラフ | DFS |
| abc020 | C - 壁抜け | BFS, 二分探索 |
| abc151 | D - Maze Master | BFS |
| abc168 | D - .. (Double Dots) | BFS |
| abc184 | E - Third Avenue | BFS |
| abc185 | E - Sequence Matching | DP |
| abc187 | E - Through Path | DFS, いもす法 |
| abc213 | E - Stronger Takahashi | BFS |
| arc011 | C - ダブレット | BFS |
| arc003 | C - 暗闇帰り道 | BFS |
| arc109 | A - Hands | BFS |
| agc033 | A - Darker and Darker | BFS |
| agc043 | A - Range Flip Find Route | DP |
| past202005-open | G - グリッド金移動 | BFS |
| abc191 | E - Come Back Quickly | Dijkstra |
| abc192 | E - Train | Dijkstra |
| past201912-open | J - 地ならし | Dijkstra |
| past201912-open | K - 巨大企業 | Euler Tour |
| abc163 | F - path pass i | DFS |
| abc030 | C - 飛行機乗り | 二分探索 |
| abc119 | D - Lazy Faith | 二分探索 |
| abc128 | E - Roadwork | Misc |
| abc143 | D - Triangles | 二分探索 |
| abc144 | E - Gluttony | 二分探索 |
| abc146 | C - Buy an Integer | 二分探索 |
| abc174 | E - Logs | 二分探索 |
| abc192 | D - Base n | 二分探索 |
| abc205 | D - Kth Excluded | 二分探索 |
| abc212 | C - Min Difference | 二分探索 |
| arc004 | C - 平均値太郎の憂鬱 ( The melancholy of Taro Heikinchi ) | 数学 |
| arc037 | C - 億マス計算 | 二分探索 |
| arc050 | B - 花束 | 二分探索 |
| arc109 | B - log | 二分探索 |
| abc080 | C - Shopping Street | bit 全探索 |
| abc173 | C - H and V | bit 全探索 |
| abc190 | C - Bowls and Dishes | bit 全探索 |
| past201912-open | G - 組分け | bit 全探索 |
| arc107 | B - Quadruple | Misc |
| abc016 | C - 友達の友達 | Floyd-Warshall |
| abc143 | E - Travel by Car | Floyd-Warshall |
| arc001 | B - リモコン | BFS |
| abc123 | D - Cake 123 | Heap |
| abc137 | D - Summer Vacation | Heap |
| abc141 | D - Powerful Discount Tickets | Heap |
| past202004-open | F - タスクの消化 | Heap |
| past202004-open | L - 辞書順最小 | Heap |
| abc052 | C - Factors of Factorial | 素因数分解 |
| abc114 | D - 756 | 素因数分解 |
| abc142 | D - Disjoint Set of Common Divisors | 素因数分解 |
| abc152 | E - Flatten | 素因数分解 |
| abc169 | D - Div Game | 素因数分解 |
| abc172 | D - Sum of Divisors | 素因数分解 |
| abc177 | E - Coprime | 素因数分解 |
| arc034 | C - 約数かつ倍数 | 素因数分解 |
| arc026 | B - 完全数 | 約数列挙 |
| abc190 | D - Staircase Sequences | 約数列挙 |
| arc077 | D - 11 | 組み合わせ |
| abc132 | D - Blue and Red Balls | 組み合わせ |
| abc151 | E - Max-Min Sums | 組み合わせ |
| abc171 | F - Strivore | 組み合わせ |
| abc178 | D - Redistribution | 組み合わせ |
| arc023 | C - タコヤ木 | 組み合わせ |
| arc039 | B - 高橋幼稚園 | 組み合わせ |
| abc174 | F - Range Set Query | Binary Indexed Tree |
| abc194 | E - Mex Min | しゃくとり法 |
| arc045 | B - ドキドキデート大作戦高橋君 | 累積和, いもす法 |
| arc043 | B - 難易度 | 累積和, 二分探索 |
| chokudai_S001 | K - 辞書順で何番目？ | Binary Indexed Tree |
| abc170 | E - Smart Infants | Multiset |
| abc177 | F - I hate Shortest Path Problem | Multiset |
| colopl2018-qual | C - すぬけそだて――ごはん―― | bit 全探索 |
| dwacon6th-prelims | B - Fusing Slimes | 累積和, 逆元 |
| abc150 | E - Change a Little Bit | 組み合わせ |
| abc149 | F - Surrounded Nodes | 全方位木 DP, 逆元 |
| dwacon6th-prelims | C - Cookie Distribution | DP, 組み合わせ |
| dp | A - Frog 1 | DP |
| dp | B - Frog 2 | DP |
| dp | C - Vacation | DP |
| dp | D - Knapsack 1 | DP |
| dp | E - Knapsack 2 | DP |
| dp | F - LCS | DP |
| dp | G - Longest Path | DP |
| dp | H - Grid 1 | DP |
| dp | I - Coins | DP |
| abc280 | E - Critical Hit | DP |
| dp | J - Sushi | DP |
| abc275 | E - Sugoroku 4 | DP |
| abc263 | E - Sugoroku 3 | DP |
| tdpc | J - ボール | DP |
| past201912-open | O - 持久戦 | DP |
| past201912-open | A - 2 倍チェック | Misc |
| past201912-open | M - おまかせ | 二分探索 |
| abc144 | F - Fork in the Road | DP |
| dp | K - Stones | DP |
| dp | M - Candies | DP |
| dp | P - Independent Set | DP |
| dp | Q - Flowers | DP, Segment Tree |
| dp | R - Walk | DP |
| dp | S - Digit Sum | 桁 DP |
| dp | T - Permutation | DP |
| dp | W - Intervals | DP, Lazy Segment Tree |
| dp | X - Tower | DP |
| dp | Y - Grid 2 | DP, 包除原理 |
| dp | Z - Frog 3 | DP, Convex Hull Trick |
| colopl2018-final-open | C - スペースエクスプローラー高橋君 | Convex Hull Trick |
| abc098 | B - Cut and Count | Misc |
| typical90 | 017 - Crossing Segments（★7） | Binary Indexed Tree |
| abc209 | F - Deforestation | DP |
| abc160 | F - Distributing Integers | 全方位木 DP |