Which programming problems have you enjoyed the most solving or you like its solution best, etc.?
→ Обратите внимание
До соревнования
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.11.2024 22:25:00 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
I liked 297E - Mystic Carvings, mostly because of the emoticon-like figures :). It also has a very elegant solution.
for me it's Choosing Capital for Treeland
My favourite problem is 242E - XOR on Segment.
you remembered me this blog :D
Amazing. Maybe you were lucky or submit it when the sever wasn't busy. I just copied your code and submit it and it get TLE!!! Here's the submission 3699691.
server does not affect the speed of compiler, try to submit it many times because the running time of this code is nearby the time limit and there is a little bit difference between running time for each submit, so I think you will succeed after a few tries :)
Yes. You are right. But you ARE lucky due to passed all tests in your first submission of this code :)
Which data structure did you use to solve the problem?
clearly it's segment tree.
you can find here tutorial for this problem.
Segment tree. Actually I never understand segment tree and have many problems to code it for many problems, but I do code it for this problem. That's why I liked it. My code passed all tests using almost half of limits.
Powerful array
My favourite problem is 196B - Infinite Maze, from our contest. Idea: Hohol. Easy and tricky.
'Dima and Horses' and 'Dima and Figure'
140F - New Year Snowflake
229C - Triangles is very interesting problem in my opinion.
http://mirror.codeforces.com/problemset/problem/280/C http://mirror.codeforces.com/problemset/problem/268/E
I think they are interesting. They need very few codes.