Glebegor-'s blog

Help with this topics, UwU.
By Glebegor-, history, 3 months ago, In English

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!!!

  • Vote: I like it
  • -12
  • Vote: I do not like it

»
3 months ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

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)

→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks! I have seen the first post. They are good!

    → Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    I totally agree. usaco.guide is the best coding platform I know of, for all levels of coders.

    → Reply
    • »
      »
      »
      3 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      yeah i like solve problem silver and gold its have a lot of information

      → Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks!!! I will try that!

    → Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

What is andrew's algorithm ?

→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    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.

    → Reply
»
3 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

This might help: Competitive Programmer's Handbook

→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Yeah I have read that topic by topic and one of the hardest problem for me was a Andrew's algorithm.

    → Reply
    • »
      »
      »
      3 months ago, # ^ |
      ← Rev. 2   Vote: I like it +1 Vote: I do not like it

      Why are you worrying about Andrew's Algorithm when you are a pupil? To flex? Reach specialist first bruh

      → Reply
      • »
        »
        »
        »
        3 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I will reach spec in next few contests but in this year on one of the local contests I had this problem.

        → Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Why so many downvotes...

→ Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

https://codeforces.net/blog/entry/55274

→ Reply
»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

listing segtree and rmq as separate topics is crazy listing modinverse and choose/permutation is also crazy

→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thank you for explaining. I'm not good CP programmer right now. And I didn't know that.

    → Reply