Pagini recente » Cod sursa (job #3176402) | Cod sursa (job #457807) | Cod sursa (job #2402185) | Cod sursa (job #3271355) | Cod sursa (job #755955)
Cod sursa(job #755955)
#include<fstream>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
int n,m,i,j,k;
short leg[10000][10000];
struct friendship
{
int x,y;
};
friendship a[66666];
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>a[i].x>>a[i].y;
leg[a[i].x][a[i].y]=leg[a[i].y][a[i].x]=1;
}
int k2=0;
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
for(k=j+1;j<=n;j++)
if(leg[a[i].x][a[j].y]==leg[a[i].y][a[k].x]==leg[a[j].x][a[k].y]==1)
k2++;
}
g<<k2;
return 0;
}