Submit | All submissions | Best solutions | Back to list |
Problem hidden
PT07Z - Longest path in a tree |
You are given an unweighted, undirected tree. Write a program to output the length of the longest path (from one node to another) in that tree. The length of a path in this case is number of edges we traverse from source to destination.
Input
The first line of the input file contains one integer N – number of nodes in the tree (0 < N ≤ 10000). Next N-1 lines contain N-1 edges of that tree – Each line contains a pair (u, v) means there is an edge between node u and node v (1 ≤ u, v ≤ N).
Output
Print the length of the longest path on one line.
Example
Input: 3 1 2 2 3 Output: 2
Added by: | Thanh-Vy Hua |
Date: | 2007-03-28 |
Time limit: | 0.5s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON RUBY SCM guile SCM qobi ST TEXT WHITESPACE |
Resource: | Co-author Amber |