Codeforces Round #277.5 (Div. 2) D??Unbearable Controversy of Being_html/css_WEB-ITnose

D. Unbearable Controversy of Being

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Tomash keeps wandering off and getting lost while he is walking along the streets of Berland. It's no surprise! In his home town, for any pair of intersections there is exactly one way to walk from one intersection to the other one. The capital of Berland is very different!

Tomash has noticed that even simple cases of ambiguity confuse him. So, when he sees a group of four distinct intersections a, b, c and d, such that there are two paths from a to c ? one through b and the other one through d, he calls the group a "damn rhombus". Note that pairs (a,?b), (b,?c), (a,?d), (d,?c) should be directly connected by the roads. Schematically, a damn rhombus is shown on the figure below:

Other roads between any of the intersections don't make the rhombus any more appealing to Tomash, so the four intersections remain a "damn rhombus" for him.

Given that the capital of Berland has n intersections and m roads and all roads are unidirectional and are known in advance, find the number of "damn rhombi" in the city.

When rhombi are compared, the order of intersections b and d doesn't matter.

Input

The first line of the input contains a pair of integers n, m (1?≤?n?≤?3000,?0?≤?m?≤?30000) ? the number of intersections and roads, respectively. Next m lines list the roads, one per line. Each of the roads is given by a pair of integers ai,?bi (1?≤?ai,?bi?≤?n;ai?≠?bi) ? the number of the intersection it goes out from and the number of the intersection it leads to. Between a pair of intersections there is at most one road in each of the two directions.

It is not guaranteed that you can get from any intersection to any other one.

Output

Print the required number of "damn rhombi".

Sample test(s)

Input

5 41 22 31 44 3

Output

Input

4 121 21 31 42 12 32 43 13 23 44 14 24 3

Output

12

水题，只要计算出每个点走两步以后到达第三个点的所有走法，然后C(2, n)

#include <map>#include <set>#include <list>#include <queue>#include <stack>#include <vector>#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int N = 3010;const int M = 30010;struct node{	int next;	int to;}edge[M];int head[N];int tot;int num[N][N];void addedge(int from, int to){	edge[tot].to = to;	edge[tot].next = head[from];	head[from] = tot++;}int main(){	int n, m;	while (~scanf("%d%d", &n, &m))	{		int u, v, w;		memset (head, -1, sizeof(head));		memset (num, 0, sizeof(num));		tot = 0;		for (int i = 1; i <= m; ++i)		{			scanf("%d%d", &u, &v);			addedge(u, v);		}		for (u = 1; u <= n; ++u)		{			for (int i = head[u]; ~i; i = edge[i].next)			{				v = edge[i].to;				for (int j = head[v]; ~j; j = edge[j].next)				{					w = edge[j].to;					num[u][w]++;				}			}		}		__int64 ans = 0;		for (int i = 1; i <= n; ++i)		{			for (int j = 1; j <= n; ++j)			{				if (i == j)				{					continue;				}				ans += (__int64)(num[i][j] - 1) * num[i][j] / 2;			}		}		printf("%I64d\n", ans);	}	return 0;}