Heidi has finally found the mythical Tree of Life – a legendary combinatorial structure which is said to contain a prophecy crucially needed to defeat the undead armies.
On the surface, the Tree of Life is just a regular undirected tree well-known from computer science. This means that it is a collection of npoints (called vertices), some of which are connected using n - 1 line segments (edges) so that each pair of vertices is connected by apath (a sequence of one or more edges).
To decipher the prophecy, Heidi needs to perform a number of steps. The first is counting the number of lifelines in the tree – these are paths of length 2, i.e., consisting of two edges. Help her!
The first line of the input contains a single integer n – the number of vertices in the tree (1 ≤ n ≤ 10000). The vertices are labeled with the numbers from 1 to n. Then n - 1 lines follow, each describing one edge using two space-separated numbers a b – the labels of the vertices connected by the edge (1 ≤ a < b ≤ n). It is guaranteed that the input represents a tree.
Print one integer – the number of lifelines in the tree.
4 1 2 1 3 1 4
3
5 1 2 2 3 3 4 3 5
4
In the second sample, there are four lifelines: paths between vertices 1 and 3, 2 and 4, 2 and 5, and 4 and 5.
题意: 就是给你一棵树,问你有多少组长度为2的路。这里用dfs搜索就可以了
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 10010;
struct Edge{
int v,next;
};
Edge edge[maxn * 2];
int head[maxn];
int numedge,n,ans;
bool vis[maxn];
void init()
{
memset(head,-1,sizeof(head));
numedge = 0;
}
void addedge(int x,int y)
{
edge[numedge].v = y;
edge[numedge].next = head[x];
head[x] = numedge++;
}
void dfs(int s,int deep)
{
if(deep == 2)
{
ans++;
return ;
}
if(!vis[s])
{
for(int i = head[s] ; i != -1 ; i = edge[i].next)
{
if(!vis[edge[i].v])
{
vis[s] = true;
dfs(edge[i].v,deep+1);
}
}
}
}
int main()
{
while(~scanf("%d",&n))
{
init();
for(int i = 1 ; i < n ; i++)
{
int a,b;
scanf("%d%d",&a,&b);
addedge(a,b);
addedge(b,a);
}
ans = 0;
for(int i = 1 ; i <= n ; i++)
{
memset(vis,false,sizeof(vis)); // 注意每次重新的节点开始搜索的都需要初始化vis数组
dfs(i,0);
}
printf("%d\n",ans / 2); // 最后ans要除以2,因为他它在搜索时有重复的路
}
return 0;
}