Problem ID Title Solved Submit Pass Rate
102477[AtCoder]ABC247 Ex - Rearranging Problem000.000%
102487[AtCoder]ABC248 Ex - Beautiful Subsequences000.000%
102493[AtCoder]ABC249 D - Index Trio000.000%
102496[AtCoder]ABC249 G - Xor Cards000.000%
102497[AtCoder]ABC249 Ex - Dye Color000.000%
102504[AtCoder]ABC250 E - Prefix Equality000.000%
102507[AtCoder]ABC250 Ex - Trespassing Takahashi000.000%
102510[AtCoder]ABC251 A - Six Characters010.000%
102517[AtCoder]ABC251 Ex - Fill Triangle000.000%
102527[AtCoder]ABC252 Ex - K-th beautiful Necklace000.000%
102532[AtCoder]ABC253 C - Max - Min Query000.000%
102535[AtCoder]ABC253 F - Operations on a Matrix000.000%
102537[AtCoder]ABC253 Ex - We Love Forest000.000%
102547[AtCoder]ABC254 Ex - Multiply or Divide by 2000.000%
102557[AtCoder]ABC255 Ex - Range Harvest Query000.000%
102562[AtCoder]ABC256 C - Filling 3x3 array000.000%
102567[AtCoder]ABC256 Ex - I like Query Problem000.000%
102576[AtCoder]ABC257 G - Prefix Concatenation000.000%
102577[AtCoder]ABC257 Ex - Dice Sum 2000.000%
102581[AtCoder]ABC258 B - Number Box000.000%
102587[AtCoder]ABC258 Ex - Odd Steps000.000%
102592[AtCoder]ABC259 C - XX to XXX000.000%
102597[AtCoder]ABC259 Ex - Yet Another Path Counting000.000%
102607[AtCoder]ABC260 Ex - Colorfulness000.000%
102617[AtCoder]ABC261 Ex - Game on Graph010.000%
102622[AtCoder]ABC262 C - Min Max Pair000.000%
102627[AtCoder]ABC262 Ex - Max Limited Sequence000.000%
102637[AtCoder]ABC263 Ex - Intersection 2000.000%
102642[AtCoder]ABC264 C - Matrix Reducing000.000%
102647[AtCoder]ABC264 Ex - Perfect Binary Tree000.000%
102651[AtCoder]ABC265 B - Explore000.000%
102657[AtCoder]ABC265 Ex - No-capture Lance Game000.000%
102662[AtCoder]ABC266 C - Convex Quadrilateral080.000%
102667[AtCoder]ABC266 Ex - Snuke Panic (2D)000.000%
102672[AtCoder]ABC267 C - Index × A(Continuous ver.)000.000%
102673[AtCoder]ABC267 D - Index × A(Not Continuous ver.)000.000%
102675[AtCoder]ABC267 F - Exactly K Steps000.000%
102677[AtCoder]ABC267 Ex - Odd Sum000.000%
102681[AtCoder]ABC268 B - Prefix?000.000%
102687[AtCoder]ABC268 Ex - Taboo000.000%
102693[AtCoder]ABC269 D - Do use hexagon grid000.000%
102697[AtCoder]ABC269 Ex - Antichain000.000%
102707[AtCoder]ABC270 Ex - add 1 000.000%
102715[AtCoder]ABC271 F - XOR on Grid Path040.000%
102717[AtCoder]ABC271 Ex - General General000.000%
102722[AtCoder]ABC272 C - Max Even000.000%
102724[AtCoder]ABC272 E - Add and Mex000.000%
102727[AtCoder]ABC272 Ex - Flipping Coins 2000.000%
102737[AtCoder]ABC273 Ex - Inv(0,1)ving Insert(1,0)n000.000%
102747[AtCoder]ABC274 Ex - XOR Sum of Arrays000.000%
102757[AtCoder]ABC275 Ex - Monster000.000%
102767[AtCoder]ABC276 Ex - Construct a Matrix000.000%
102775[AtCoder]ABC277 F - Sorting a Matrix010.000%
102777[AtCoder]ABC277 Ex - Constrained Sums000.000%
102787[AtCoder]ABC278 Ex - make 1000.000%
102795[AtCoder]ABC279 F - BOX070.000%
102797[AtCoder]ABC279 Ex - Sum of Prod of Min000.000%
102801[AtCoder]ABC280 B - Inverse Prefix Sum010.000%
102802[AtCoder]ABC280 C - Extra Character010.000%
102806[AtCoder]ABC280 G - Do Use Hexagon Grid 2000.000%
102807[AtCoder]ABC280 Ex - Substring Sort000.000%
102813[AtCoder]ABC281 D - Max Multiple000.000%
102815[AtCoder]ABC281 F - Xor Minimization000.000%
102817[AtCoder]ABC281 Ex - Alchemy000.000%
102827[AtCoder]ABC282 Ex - Min + Sum000.000%
102836[Atcoder]ABC283 G - Partial Xor Enumeration000.000%
102837[Atcoder]ABC283 Ex - Popcount Sum000.000%
102847[AtCoder]ABC284 Ex - Count Unlabeled Graphs000.000%
102851[AtCoder]ABC285 B - Longest Uncommon Prefix000.000%
102857[AtCoder]ABC285 Ex - Avoid Square Number000.000%
102867[AtCoder]ABC286 Ex - Don't Swim000.000%
102877[AtCoder]ABC287 Ex - Directed Graph and Query000.000%
102887[AtCoder]ABC288 Ex - A Nameless Counting Problem000.000%
102897[Atcoder]ABC289 Ex - Trio000.000%
102902[Atcoder]ABC290 C - Max MEX080.000%
102905[Atcoder]ABC290 F - Maximum Diameter000.000%
102907[Atcoder]ABC290 Ex - Bow Meow Optimization000.000%
102917[Atcoder]ABC291 Ex - Balanced Tree000.000%
102927[Atcoder]ABC292 Ex - Rating Estimator020.000%
102936[Atcoder]ABC293 G - Triple Index010.000%
102937[Atcoder]ABC293 Ex - Optimal Path Decomposition000.000%
102944[Atcoder]ABC294 E - 2xN Grid101952.632%
102947[Atcoder]ABC294 Ex - K-Coloring000.000%
102957[Atcoder]ABC295 Ex - E or m000.000%
102962[Atcoder]ABC296 C - Gap Existence030.000%
102967[Atcoder]ABC296 Ex - Unite000.000%
102975[Atcoder]ABC297 F - Minimum Bounding Box 2000.000%
102977[Atcoder]ABC297 Ex - Diff Adjacent000.000%
102981[Atcoder]ABC298 B - Coloring Matrix040.000%
102987[Atcoder]ABC298 Ex - Sum of Min of Length000.000%
102994[Atcoder]ABC299 E - Nearest Black Vertex080.000%
102997[Atcoder]ABC299 Ex - Dice Sum Infinity000.000%
103007[Atcoder]ABC300 Ex - Fibonacci: Revisited000.000%
103017[Atcoder]ABC301 Ex - Difference of Distance000.000%
103027[Atcoder]ABC302 Ex - Ball Collector010.000%
103037[Atcoder]ABC303 Ex - Constrained Tree Degree000.000%
103046[Atcoder]ABC304 G - Max of Medians000.000%
103047[Atcoder]ABC304 Ex - Constrained Topological Sort000.000%
103055[Atcoder]ABC305 F - Dungeon Explore040.000%
103057[Atcoder]ABC305 Ex - Shojin000.000%