Pagini recente » Cod sursa (job #2174556) | Cod sursa (job #2022392) | Cod sursa (job #594051) | Cod sursa (job #993708) | Cod sursa (job #1331120)
#include <cstdio>
#include <algorithm>
#include <bitset>
#define NMAX 66007
#define MMAX 4107
using namespace std;
int n, m, a[NMAX],b[NMAX],Ans;
bitset <MMAX> c[MMAX], Sol;
int main(){
freopen("triplete.in", "r", stdin);
freopen("triplete.out", "w", stdout);
scanf("%d %d", &n, &m);
for(int i = 1; i <= m; ++i){
scanf("%d %d", &a[i], &b[i]);
c[min(a[i], b[i])].set(max(a[i], b[i]));
}
for(int i = 1; i <= m; ++i){
Sol = (c[a[i]] & c[b[i]]);
Ans += Sol.count();
}
printf("%d\n", Ans);
return 0;
}