Pagini recente » Cod sursa (job #878203) | Cod sursa (job #2619446) | Cod sursa (job #3278428) | Cod sursa (job #1051112) | Cod sursa (job #2543974)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("triplete.in");
ofstream cout("triplete.out");
int cnt=0;
vector<int> v[5000];
int d[5000][5000];
void dfs(int nod,int lung,int st){
if(lung==2){
if(d[nod][st]==1){
cnt++;
}
return;
}
for(int i=0;i<v[nod].size();i++){
dfs(v[nod][i],lung+1,st);
}
}
int main()
{
int n,m,a,b;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a>>b;
v[a].push_back(b);
d[a][b]=1;
v[b].push_back(a);
d[b][a]=1;
}
for(int i=1;i<=n;i++){
dfs(i,0,i);
}
cout<<cnt/6;
return 0;
}