Can someone write some problem sets below? I have trouble with this topics: 1. Permutations 2. Brute force 3. DP 4. DFS, BFS 5. Dijkstra 6. BIT 7. nCr, nPr 8. Mod inverse 9. Bitmasks 10. Segment trees 11. Andrew’s algorithm 12. RMQ
Thanks!!!
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.12.2024 21:05:04 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
https://mirror.codeforces.com/blog/entry/57282
https://mirror.codeforces.com/blog/entry/125623
https://mirror.codeforces.com/blog/entry/91363
yea!! UPD:(thanks to the author of that blogs)
Thanks! I have seen the first post. They are good!
try to use USACO guide this website has alot of topics to learn with in different levels and good luck:) for oh i forget you can solve segment tree from EDU codeforces and CESE and good luck again
I totally agree. usaco.guide is the best coding platform I know of, for all levels of coders.
yeah i like solve problem silver and gold its have a lot of information
Thanks!!! I will try that!
What is andrew's algorithm ?
I have seen it in programming competitive handbook, something like geometrical subset of the verticals in set. Btw, I didn't understand it well, sorry for the my explanation.
This might help: Competitive Programmer's Handbook
Yeah I have read that topic by topic and one of the hardest problem for me was a Andrew's algorithm.
Why are you worrying about Andrew's Algorithm when you are a pupil? To flex? Reach specialist first bruh
I will reach spec in next few contests but in this year on one of the local contests I had this problem.
Why so many downvotes...
https://mirror.codeforces.com/blog/entry/55274
Wow. Nice source thanks!
listing segtree and rmq as separate topics is crazy listing modinverse and choose/permutation is also crazy
Thank you for explaining. I'm not good CP programmer right now. And I didn't know that.