You are given a tree with n vertices. Review that a tree is an associated undirected diagram without cycles. We consider a tree a Fib-tree, if its number of vertices rises to Fk for some k, and somewhere around one of the accompanying conditions holds: The tree comprises of just 1 vertex;
Correct answer will be upvoted else downvoted. Computer science.
You are given a tree with n vertices. Review that a tree is an associated undirected diagram without cycles.
We consider a tree a Fib-tree, if its number of vertices rises to Fk for some k, and somewhere around one of the accompanying conditions holds:
The tree comprises of just 1 vertex;
You can isolate it into two Fib-trees by eliminating some edge of the tree.
Decide if the given tree is a Fib-tree or not.
Input
The main line of the input contains a solitary integer n (1≤n≤2⋅105) — the number of vertices in the tree.
Then, at that point, n−1 lines follow, every one of which contains two integers u and v (1≤u,v≤n, u≠v), addressing an edge between vertices u and v. It's dependable that given edges structure a tree.
Output
Print "YES" if the given tree is a Fib-tree, or "NO" in any case.
You can print your reply regardless. For instance, assuming the appropriate response is "YES", the output "Yes" or "yeS" will likewise be considered as right reply.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
