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!!!
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
3 | adamant | 156 |
5 | cry | 155 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
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!!!
Name |
---|
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.