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 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | jiangly | 3578 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3531 |
| 9 | Radewoosh | 3521 |
| 10 | Um_nik | 3482 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 28.04.2024 01:55:10 (k1).
Десктопная версия, переключиться на мобильную.
При поддержке
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://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.