Pagini recente » Cod sursa (job #2968633) | Cod sursa (job #677685) | Cod sursa (job #3286061) | Cod sursa (job #1475867) | Cod sursa (job #1907048)
#include <bits/stdc++.h>
using namespace std;
int m,n,i,j,in,sf,mid,nr,k;
pair<int,int>x[4196];
vector<int>g[66536];
bitset<4196>b[4196];
int main()
{
ifstream f ("triplete.in");
ofstream G ("triplete.out");
f>>n>>m;
for(i=1; i<=m; ++i)
f>>x[i].first>>x[i].second;
for(i=1; i<=m; ++i)
{
g[x[i].first].push_back(x[i].second);
g[x[i].second].push_back(x[i].first);
b[x[i].first][x[i].second]=b[x[i].second][x[i].first]=1;
}
for(i=1; i<=n; ++i)
for(j=0; j<g[i].size(); ++j)
for(k=0; k<g[g[i][j]].size(); ++k)
if(b[i][g[g[i][j]][k]])++nr;
G<<nr/6;
return 0;
}