Pagini recente » Cod sursa (job #169588) | Cod sursa (job #2974366) | Cod sursa (job #1804034) | Cod sursa (job #2568234) | Cod sursa (job #2914582)
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
vector <int> v[4097];
bitset <4097> match[4097];
int main()
{
freopen("triplete.in","r",stdin);
freopen("triplete.out","w",stdout);
ios_base::snc_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m,i,a,b;
cin>>n>>m;
for(i=1; i<=m; i++)
{
cin>>a>>b;
match[a][b]=1;
match[b][a]=1;
v[a].push_back(b);
v[b].push_back(a);
}
long long cnt=0;
for(i=1; i<=n; i++)
for(auto it:v[i])
cnt+=(match[i]&match[it]).count();
cout<<cnt/6;
return 0;
}