Pagini recente » Cod sursa (job #198963) | Cod sursa (job #1493786) | Cod sursa (job #1823031) | Cod sursa (job #3237756) | Cod sursa (job #1881978)
#include <iostream>
#include <fstream>
#include <bitset>
#include <vector>
#define Nmax 4105
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
vector <short int> G[Nmax];
bitset <Nmax> BS[Nmax];
unsigned int N,M,sol;
void read()
{
fin>>N>>M;
for(int i=1;i<=M;i++)
{
int x,y;
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
BS[x].set(y,1);
BS[y].set(x,1);
}
}
void solve()
{
for(int i=1;i<=N;i++)
{
for(int j=0;j<G[i].size();j++)
{
int vecin=G[i][j];
sol+=(BS[i]&BS[vecin]).count();
}
}
cout<<sol/6;
}
int main()
{
read();
solve();
return 0;
}