跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2503. Polo the Penguin and Trees

  • ID: 2509
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:挑战
  • 上传者:
  • 组合数学
  • 搜索
  • 树
  • 数学
  • 数据结构
  • 挑战
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Polo the Penguin and Trees

题目描述

D. Polo the Penguin and Trees
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Little penguin Polo has got a tree − a non-directed connected acyclic graph, containing n nodes and n-1 edges. We will consider the tree nodes numbered by integers from 1 to n.

Today Polo wonders, how to find the number of pairs of paths that don't have common nodes. More formally, he should find the number of groups of four integers a,b,c and d such that:

  • 1≤a<b≤n;
  • 1≤c<d≤n;
  • there's no such node that lies on both the shortest path from node a to node b and from node c to node d.

The shortest path betweem two nodes is the path that is shortest in the number of edges.

Help Polo solve this problem.

Input

The first line contains integer n (1≤n≤80000) − the number of tree nodes. Each of the following n-1 lines contains a pair of integers ui and vi (1≤ui,vi≤n;ui≠vi) − the i-th edge of the tree.

It is guaranteed that the given graph is a tree.

Output

In a single line print a single integer − the answer to the problem.

Please do not use the %lld specificator to read or write 64-bit numbers in C++. It is recommended to use the cin, cout streams or the %I64d specificator.

Examples
Input
4
1 2
2 3
3 4
Output
2

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2141 题。保留原作者与原赛事署名。