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!
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 20.05.2026 08:25:55 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
I remember seeing a tag of the form "shortest paths".
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.
You can look at this problem, this is 2100 but exactly not hard. Also look at that one from SPOJ.
Thanks u, could you give me more problems apart from 2 above?
That's all I can do because Codeforces doesn't have a filter for "just Dijkstra". But you can look at SPOJ.
https://mirror.codeforces.com/problemset?order=BY_RATING_ASC&tags=shortest+paths%2C1700-3300#
This have every BFS, DFS and dijkstra problems from several OJs
Maybe try the site A2OJ.. it has problems sorted by level from codeforces and many other sites.