What's your favorite problem or contest?
Please Comment it ;)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
What's your favorite problem or contest?
Please Comment it ;)
| Name |
|---|



Water Melon
Who got wrong answer on test 5 too?? xD
me :
Wrong answer on test 5
Wrong answer on test 8
me
Me :-))
54381510
CF1137C Museums Tour
sum of two numbers.
Serge and Dining Room
https://atcoder.jp/contests/apc001/tasks/apc001_f
Codeforces Round #260 (Div.1)
IOI13 artclass
The best problem in the world
717I — Cowboy Beblop at his computer
Did you solve that? What did you do? Binary search + idea or you did Some Other Algorithms
1184E2 - Daleks' Invasion (medium)
158B — Taxi
I can't recall actually what is the most beautiful problem I've solved. Cause whatever problem I solve, no matter how good it was, I used to forget about the problem after few days. Recently I solved All Possible Increasing Subsequences from lightoj. I had to try continuously 5 days in a row to solve it. When I found out the solution & got Accepted sign, the feelings was awesome. There is another problem. Though I didn't solved this by myself. Problem — Kquery — Spoj I read the tutorial from DarthKnight's blog post . That's not the problem that amused me, it was the idea how to solve this. that was one of the most beautiful idea I've ever seen.
Yeah. When you solve a problem after much time thinking on it and many unsuccessful submissions, you feel great! I'll never forget such problems.
I've some problems with my mind. Even if I stop practicing an algorithm in what I'm good at, I almost completely forget this algorithm. I just remember the very basic concept. Next time I try to solve with this, I've to read/learn it from very basic.
409F 000001
D. Mike and Feet
wow that is one of my unsolved problems :(
wow
B. Uniqueness
cf1110H. Modest Substrings
I think the idea of this problem is very good.