Glebegor-'s blog

By Glebegor-, history, 3 hours 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
  • -3
  • Vote: I do not like it

»
3 hours ago, # |
Rev. 2   Vote: I like it +5 Vote: I do not like it
  • »
    »
    72 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

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

»
2 hours 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

  • »
    »
    2 hours 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.

    • »
      »
      »
      114 minutes 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

  • »
    »
    90 minutes ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks!!! I will try that!

»
2 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

What is andrew's algorithm ?

  • »
    »
    2 hours ago, # ^ |
      Vote: I like it +3 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.

»
82 minutes ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it