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!!!
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
40:48:26
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
40:48:26
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 00:46:36 (l1).
Десктопная версия, переключиться на мобильную.
При поддержке
https://codeforces.net/blog/entry/57282
https://codeforces.net/blog/entry/125623
https://codeforces.net/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://codeforces.net/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.