Mine is 1734D - Slime Escape becuase it's nice problem and the most difficulty problem I've solved during contest. What about your?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Mine is 1734D - Slime Escape becuase it's nice problem and the most difficulty problem I've solved during contest. What about your?
| Name |
|---|



I'm not sure. Maybe 1270E - Divide Points or 1748E - Yet Another Array Counting Problem.
Mine is Hello world problem
1852B — Imbalanced Arrays or C from the same round.
My favorite problem is case from the 5th grade OJI 2005. I think it is very useful for developing mechanical skill like taking numbers of a number and counting the digits. Also you can learn how to display information on the screen or into file from this problem so it is a nice of a programming problem from which you can learn a lot of useful information that you can later apply in other competitive problems.
EDIT: The problem is actually from 2006. I would like to apologise to all my fans for misleading them and giving them false information. I regret this negligence on my part.
My favorite problem is segment tree beats
flaaffy is not my favorite problem