What's your favorite problem or contest?
Please Comment it ;)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
What's your favorite problem or contest?
Please Comment it ;)
Название |
---|
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 - Вторжение Далеков (средняя)
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.