Pagini recente » Cod sursa (job #3274844) | Cod sursa (job #1628060) | Cod sursa (job #124096) | Cod sursa (job #705586) | Cod sursa (job #2455472)
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
bitset<4100>graf[4100], r;
int n, m, a, b, rez, ind_maxi;
void citire()
{
f >> n >> m;
for (int i=1; i<=m; ++i)
{
f >> a >> b;
graf[a][b]=1;
graf[b][a]=1;
}
}
void rezolvare()
{
for (int i=1; i<=n; ++i)
{
for (int j=i+1; j<=n; ++j)
{
if (graf[i][j])
{
r=(graf[i] & graf[j]);
rez+=r.count();
}
}
}
}
int main()
{
citire();
rezolvare();
g << rez/3;
return 0;
}