| 102556 | [AtCoder]ABC255 G - Constrained Nim | 0 | 0 | 0.000% |
| 102627 | [AtCoder]ABC262 Ex - Max Limited Sequence | 0 | 0 | 0.000% |
| 102636 | [AtCoder]ABC263 G - Erasing Prime Pairs | 0 | 0 | 0.000% |
| 102676 | [AtCoder]ABC267 G - Increasing K Times | 0 | 0 | 0.000% |
| 102702 | [AtCoder]ABC270 C - Simple path | 0 | 6 | 0.000% |
| 102781 | [AtCoder]ABC278 B - Misjudge the Time | 0 | 7 | 0.000% |
| 102815 | [AtCoder]ABC281 F - Xor Minimization | 0 | 0 | 0.000% |
| 102822 | [AtCoder]ABC282 C - String Delimiter | 0 | 3 | 0.000% |
| 102826 | [AtCoder]ABC282 G - Similar Permutation | 0 | 0 | 0.000% |
| 102844 | [AtCoder]ABC284 E - Count Simple Paths | 0 | 0 | 0.000% |
| 102867 | [AtCoder]ABC286 Ex - Don't Swim | 0 | 0 | 0.000% |
| 102905 | [Atcoder]ABC290 F - Maximum Diameter | 0 | 0 | 0.000% |
| 102906 | [Atcoder]ABC290 G - Edge Elimination | 0 | 0 | 0.000% |
| 102907 | [Atcoder]ABC290 Ex - Bow Meow Optimization | 0 | 0 | 0.000% |
| 102911 | [Atcoder]ABC291 B - Trimmed Mean | 0 | 11 | 0.000% |
| 102927 | [Atcoder]ABC292 Ex - Rating Estimator | 0 | 2 | 0.000% |
| 102937 | [Atcoder]ABC293 Ex - Optimal Path Decomposition | 0 | 0 | 0.000% |
| 102956 | [Atcoder]ABC295 G - Minimum Reachable City | 0 | 2 | 0.000% |
| 102965 | [Atcoder]ABC296 F - Simultaneous Swap | 0 | 4 | 0.000% |
| 102975 | [Atcoder]ABC297 F - Minimum Bounding Box 2 | 0 | 0 | 0.000% |
| 102976 | [Atcoder]ABC297 G - Constrained Nim 2 | 0 | 2 | 0.000% |
| 102996 | [Atcoder]ABC299 G - Minimum Permutation | 0 | 3 | 0.000% |
| 103023 | [Atcoder]ABC302 D - Impartial Gift | 0 | 19 | 0.000% |
| 103030 | [Atcoder]ABC303 A - Similar String | 0 | 13 | 0.000% |
| 103035 | [Atcoder]ABC303 F - Damage over Time | 0 | 0 | 0.000% |
| 103076 | [Atcoder]ABC307 G - Approximate Equalization | 0 | 0 | 0.000% |
| 103086 | [Atcoder]ABC308 G - Minimum Xor Pair Query | 0 | 0 | 0.000% |
| 103097 | [Atcoder]ABC309 Ex - Simple Path Counting Problem | 0 | 0 | 0.000% |
| 103132 | [Atcoder]ABC313 C - Approximate Equalization 2 | 0 | 9 | 0.000% |
| 103175 | [Atcoder]ABC317 F - Nim | 0 | 3 | 0.000% |
| 103193 | [Atcoder]ABC319 D - Minimum Width | 0 | 6 | 0.000% |
| 103233 | [Atcoder]ABC323 D - Merge Slimes | 0 | 3 | 0.000% |
| 103255 | [Atcoder]ABC325 F - Sensor Optimization Dilemma | 0 | 0 | 0.000% |
| 103274 | [Atcoder]ABC327 E - Maximize Rating | 0 | 4 | 0.000% |
| 103301 | [Atcoder]ABC330 B - Minimize Abs 1 | 0 | 14 | 0.000% |
| 103302 | [Atcoder]ABC330 C - Minimize Abs 2 | 0 | 15 | 0.000% |
| 103305 | [Atcoder]ABC330 F - Minimize Bounding Square | 0 | 0 | 0.000% |
| 103441 | [Atcoder]ABC344 B - Delimiter | 0 | 9 | 0.000% |
| 103452 | [Atcoder]ABC345 C - One Time Swap | 0 | 22 | 0.000% |
| 103484 | [Atcoder]ABC348 E - Minimize Sum of Distances | 0 | 4 | 0.000% |
| 103485 | [Atcoder]ABC348 F - Oddly Similar | 0 | 8 | 0.000% |
| 103525 | [Atcoder]ABC352 F - Estimate Order | 0 | 12 | 0.000% |
| 103595 | [Atcoder]ABC359 F - Tree Degree Optimization | 0 | 5 | 0.000% |
| 103642 | [Atcoder]ABC364 C - Minimum Glutton | 0 | 14 | 0.000% |
| 103644 | [Atcoder]ABC364 E - Maximum Glutton | 0 | 44 | 0.000% |
| 103665 | [Atcoder]ABC366 F - Maximum Composition | 0 | 9 | 0.000% |
| 103674 | [Atcoder]ABC367 E - Permute K times | 0 | 10 | 0.000% |
| 103683 | [Atcoder]ABC368 D - Minimum Steiner Tree | 0 | 2 | 0.000% |
| 200731 | [AtCoder]ARC073 D - Simple Knapsack | 0 | 0 | 0.000% |
| 200803 | [AtCoder]ARC080 F - Prime Flip | 0 | 0 | 0.000% |
| 200913 | [AtCoder]ARC091 F - Strange Nim | 0 | 0 | 0.000% |
| 200982 | [AtCoder]ARC098 E - Range Minimum Queries | 0 | 0 | 0.000% |
| 200990 | [AtCoder]ARC099 C - Minimization | 0 | 0 | 0.000% |
| 201000 | [AtCoder]ARC100 C - Linear Approximation | 0 | 0 | 0.000% |
| 201053 | [AtCoder]ARC105 D - Let's Play Nim | 0 | 0 | 0.000% |
| 201070 | [AtCoder]ARC107 A - Simple Math | 0 | 0 | 0.000% |
| 201110 | [AtCoder]ARC111 A - Simple Math 2 | 0 | 0 | 0.000% |
| 201114 | [AtCoder]ARC111 E - Simple Math 3 | 0 | 0 | 0.000% |
| 201140 | [AtCoder]ARC114 A - Not coprime | 0 | 0 | 0.000% |
| 201182 | [AtCoder]ARC118 C - Coprime Set | 0 | 0 | 0.000% |
| 201262 | [AtCoder]ARC126 C - Maximize GCD | 0 | 0 | 0.000% |
| 201294 | [AtCoder]ARC129 E - Yet Another Minimization | 0 | 0 | 0.000% |
| 201302 | [AtCoder]ARC130 C - Digit Sum Minimization | 0 | 0 | 0.000% |
| 201304 | [AtCoder]ARC130 E - Increasing Minimum | 0 | 0 | 0.000% |
| 201344 | [AtCoder]ARC134 E - Modulo Nim | 0 | 0 | 0.000% |
| 201364 | [AtCoder]ARC136 E - Non-coprime DAG | 0 | 0 | 0.000% |
| 201370 | [AtCoder]ARC137 A - Coprime Pair | 0 | 0 | 0.000% |
| 201395 | [AtCoder]ARC139 F - Many Xor Optimization Problems | 0 | 0 | 0.000% |
| 201420 | [AtCoder]ARC142 A - Reverse and Minimize | 0 | 0 | 0.000% |
| 201445 | [AtCoder]ARC144 F - Arithmetic Sequence Nim | 0 | 0 | 0.000% |
| 201452 | [AtCoder]ARC145 C - Split and Maximize | 0 | 0 | 0.000% |
| 201464 | [AtCoder]ARC146 E - Simple Speed | 0 | 0 | 0.000% |
| 201465 | [AtCoder]ARC146 F - Simple Solitaire | 0 | 0 | 0.000% |
| 201492 | [AtCoder]ARC149 C - Avoid Prime Sum | 0 | 0 | 0.000% |
| 201493 | [AtCoder]ARC149 D - Simultaneous Sugoroku | 0 | 0 | 0.000% |
| 201534 | [AtCoder]ARC153 E - Deque Minimization | 0 | 0 | 0.000% |
| 201553 | [AtCoder]ARC155 D - Avoid Coprime Game | 0 | 0 | 0.000% |
| 300002 | CF1B. Spreadsheets | 0 | 0 | 0.000% |
| 300004 | CF2A. Winner | 0 | 0 | 0.000% |
| 300009 | CF3C. Tic-tac-toe | 0 | 1 | 0.000% |
| 300013 | CF4C. Registration system | 0 | 0 | 0.000% |
| 300015 | CF5A. Chat Server's Outgoing Traffic | 0 | 0 | 0.000% |
| 300016 | CF5B. Center Alignment | 0 | 0 | 0.000% |
| 300018 | CF5D. Follow Traffic Rules | 0 | 0 | 0.000% |
| 300021 | CF6B. President's Office | 0 | 0 | 0.000% |
| 300026 | CF7B. Memory Manager | 0 | 0 | 0.000% |
| 300029 | CF7E. Defining Macros | 0 | 0 | 0.000% |
| 300031 | CF8B. Obsession with Robots | 0 | 0 | 0.000% |
| 300036 | CF9B. Running Student | 0 | 0 | 0.000% |
| 300037 | CF9C. Hexadecimal's Numbers | 0 | 0 | 0.000% |
| 300040 | CF10A. Power Consumption Calculation | 0 | 0 | 0.000% |
| 300041 | CF10B. Cinema Cashier | 0 | 0 | 0.000% |
| 300045 | CF11A. Increasing Sequence | 0 | 0 | 0.000% |
| 300047 | CF11C. How Many Squares? | 0 | 0 | 0.000% |
| 300048 | CF11D. A Simple Task | 0 | 0 | 0.000% |
| 300050 | CF12A. Super Agent | 0 | 0 | 0.000% |
| 300051 | CF12B. Correct Solution? | 0 | 0 | 0.000% |
| 300052 | CF12C. Fruits | 0 | 0 | 0.000% |
| 300055 | CF13A. Numbers | 0 | 0 | 0.000% |
| 300056 | CF13B. Letter A | 0 | 0 | 0.000% |