ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1471. Distance in the Tree

if there is no path from u to v , what's the output?
Posted by invokerj 26 Dec 2013 08:49
solved. thanks

Edited by author 26.12.2013 09:01
Re: if there is no path from u to v , what's the output?
Posted by sak3t 29 May 2017 15:33
There will always be one and only one path between any two vertices.
josh me aake likh diya :D

Edited by author 29.05.2017 15:34