Pagini recente » Cod sursa (job #1401993) | Cod sursa (job #210061) | Cod sursa (job #1056004) | Cod sursa (job #1845486) | Cod sursa (job #1881238)
#include<fstream>
#include<iostream>
#include<vector>
#include<bitset>
#define NMax 4105
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
int N,M,Sol;
vector <int> G[NMax];
bitset <NMax> B[NMax];
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);
B[x][y] = B[y][x] = 1;
}
}
void Solve()
{
for(int i = 1 ; i <= N ; ++i)
for(int j = 0 ; j < (int) G[i].size() ; ++j)
{
int Vecin = G[i][j];
bitset <NMax> C;
C = (B[i] & B[Vecin]);
Sol += C.count();
}
}
void Print()
{
fout<<Sol / 6<<"\n";
}
int main()
{
Read();
Solve();
Print();
fin.close();
fout.close();
return 0;
}