Pagini recente » Cod sursa (job #348845) | Cod sursa (job #82530) | Cod sursa (job #2868731) | Cod sursa (job #725376) | Cod sursa (job #2234760)
#include <bits/stdc++.h>
using namespace std;
#define NMAX 4100
#define MMAX 66000
ifstream fin("triplete.in");
ofstream fout("triplete.out");
vector <int> la[4100];
queue <int> q,q2;
int n,m,sol=0;
//BFS cu un control inteligent
void BFS(int k, int i){
if(k<=2){
int l=la[q.front()].size();
for(int j=0;j<l;j++){
if(la[q.front()][j]>q.front() || la[q.front()][j]==i && k==2)q.push(la[q.front()][j]);
}
if(q.empty())return;
else q.pop();
BFS(++k,i);
if(q.empty())return;
}else{
while(!q.empty()){
if(q.front()==i)sol++;
q.pop();
}
return;
}
}
int main(){
fin>>n>>m;
for(int i=0;i<m;i++){
int a,b;
fin>>a>>b;
la[a].push_back(b);
la[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
int l=la[i].size();
for(int j=0;j<l;j++){
if(la[i][j]>i)q.push(la[i][j]);
}
BFS(0,i);
}
fout<<sol;
return 0;
}