Hi, i'm trying to solve a cool problem but can't figure out how we can do it.
What is the minimum number of $$$moves$$$ to get from $$$x$$$ to $$$z$$$.
Input :
N
X, Y
pairs...
Eg :
5
1 3
1 2
2 4
2 5
5 6
6 3
ANS = 5 : 1,2 — 2,4 — 2,5 — 5,6 — 6,3
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
A problem with dfs....
Hi, i'm trying to solve a cool problem but can't figure out how we can do it.
What is the minimum number of $$$moves$$$ to get from $$$x$$$ to $$$z$$$.
Input :
N
X, Y
pairs...
Eg :
5
1 3
1 2
2 4
2 5
5 6
6 3
ANS = 5 : 1,2 — 2,4 — 2,5 — 5,6 — 6,3
Название |
---|