So apparently there's no bfs tag on the Problemset, at least on the first two pages.
Could anyone recommend some less advanced BFS problems, either here or on Topcoder?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
So apparently there's no bfs tag on the Problemset, at least on the first two pages.
Could anyone recommend some less advanced BFS problems, either here or on Topcoder?
Название |
---|
329B - Biridian Forest I like this problem. I could not solve it in the contest :)
http://codeforces.net/problemset/problem/242/C Div 2 C http://codeforces.net/problemset/problem/199/D relatively easy Div 2 D
One horse but it's in Russian
For non-Russian speakers, it's just the shortest path of a knight on an NxN chessboard.
But there is a formula for this. And it can be observed from the BFS pattern. You could try this, too — it's good practice.
The tag is "dfs and similar", without quotes. Not all of them are bfs, but a few of them are.
60B Serial Time is fairly straightforward, with the only added constraint being a third dimension.
There was a problem in KBTU Open 2013 Problem G, but Upsolving is closed therefore you can't send it.
In China there is an OJ called Luogu, which aims at high school students, so most of it's problems is writen in Chinese.
There are many problems in Luogu tagged by "BFS", you can check this link to see:
https://www.luogu.com.cn/problem/list?tag=126&page=1
if you don't know Chinese you may need a translation tool like google translate, wish it help :-)