Do I?
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 14.05.2026 12:46:18 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
As an expert, I believe that it is not necessary for you to learn hashing so that you reach expert, because only in very few problems hashing is the only way to solve, but for sure it is a useful technique to learn
if you can provide any good resources, it would be very helpful. Thanks
This should be plenty
I've never used hash stuff on CodeForces, so no
Nah. Chances you'd come across such in expert level are pretty rare, and even if so, deterministic alternative (KMP/Z) usually should also be available.
Not to mention, there are a number of other more prevalent topics you could improve on and reap the result.
What are topics can I learn then?
Solve some problems, learn how to use binary search.
I'd still advise basic binary search and some common sense to crack ad-hocs.
Extra quirk if using C++: try to learn
set/multiset. They're powerful tools for a handful of problems.I know all that stuff, I guess the only thing I can do is solve tons of more problems.
Seems like it. Either be faster or more precise with your code logic. That should do.
I dont know either of those and im expert
nah you dont have to but imo its not a hard concept. I just copy the usaco guide template and treat it like a black box. Moreover it may be useful in solving some problems, like I've "cheesed" some string hash problems that wouldve been impossible to come up otherwise. Just knowing that you can compare two substrings fast and what not is always good ig.
Nah.
I think I never came across a problem of rating <= 1700 whose only intended solution was hashing in cf.