Hd7's blog

How can i find list of problems on Codeforces about Dijikstra's algorithm which have difficulty less or equal than 1700?
By Hd7, history, 5 years ago, In English

I want to practice on Dijikstra topic, and I would love to solve problems on Codeforces too. How can I search for problems relate Dijikstra Topic on Codeforces. Thank you!

  • Vote: I like it
  • +2
  • Vote: I do not like it

Comments Comments (8)
| Write comment?
»
5 years ago, # |
  Vote: I like it +7 Vote: I do not like it

I remember seeing a tag of the form "shortest paths".

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

    I solved most of them with difficulty in range [1400:1600] and none of them using Dijikstra. Does problems (tag: shortest path) with higher difficulty relate Dijikstra. Could you tell me the difficulty of problems which are solved by using Dijikstra's algorithm. Thanks a lot.

    → Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

You can look at this problem, this is 2100 but exactly not hard. Also look at that one from SPOJ.

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

    Thanks u, could you give me more problems apart from 2 above?

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

      That's all I can do because Codeforces doesn't have a filter for "just Dijkstra". But you can look at SPOJ.

      → Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

https://codeforces.net/problemset?order=BY_RATING_ASC&tags=shortest+paths%2C1700-3300#

→ Reply
»
5 years ago, # |
  Vote: I like it +1 Vote: I do not like it

This have every BFS, DFS and dijkstra problems from several OJs

→ Reply
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Maybe try the site A2OJ.. it has problems sorted by level from codeforces and many other sites.

→ Reply