Pagini recente » Cod sursa (job #1095308) | Cod sursa (job #2639338) | Cod sursa (job #2852396) | Cod sursa (job #2712537) | Cod sursa (job #1442177)
#include <cstdio>
#include <cstring>
#include <algorithm>
#define Nmax 4096
#define Mmax 65539
using namespace std;
int n, m, i, j, a[Nmax][Nmax];
int sol;
struct nod
{
int x;
int y;
} v[Mmax];
void citire()
{
scanf("%d %d", &n, &m);
for (i = 1; i <= m ; ++ i)
{
scanf("%d %d", &v[i].x, &v[i].y);
a[v[i].x][v[i].y] = a[v[i].y][v[i].x] = 1;
}
}
int main()
{
freopen("triplete.in", "r", stdin);
freopen("triplete.out", "w", stdout);
citire();
for (i = 1; i <= m ; ++ i)
{
for (j = 1; j <= n ; ++ j)
if (a[v[i].x][j] && a[v[i].y][j])
++ sol;
}
printf("%d", sol / 3);
return 0;
}