Pagini recente » Cod sursa (job #627925) | Cod sursa (job #1896336) | Cod sursa (job #2784362) | Cod sursa (job #2989191) | Cod sursa (job #2720799)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
struct chestie{
int x, y;
}v[4100];
bitset<4100> M[4100];
int main()
{
int n, m;
fin >> n >> m;
for(int i = 1; i <= m; ++i){
int x, y;
fin >> x >> y;
if(x > y)
swap(x, y);
M[x][y] = 1;
v[i].x = x, v[i].y = y;
}
long long rez = 0;
for(int i = 1; i <= m; ++i)
rez += (M[v[i].x] & M[v[i].y]).count();
fout << rez << '\n';
return 0;
}