Pagini recente » Istoria paginii runda/oni2007_clasa10/clasament | Cod sursa (job #1010072) | Cod sursa (job #801249) | Istoria paginii runda/pregatire_oji_2/clasament | Cod sursa (job #1098216)
#include<cstdio>
#include<bitset>
using namespace std;
const int NMAX= 4100;
int n,m,i,x,y,a[NMAX],b[NMAX];
long long sol;
bitset<NMAX> v[NMAX];
int main()
{
freopen("triplete.in","r",stdin);
freopen("triplete.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
a[i]=x; b[i]=y;
v[x][y]=v[y][x]=1;
}
for(i=1;i<=m;i++)
sol+=(v[a[i]]&v[b[i]]).count();
printf("%lld\n",sol/3);
return 0;
}