Pagini recente » Cod sursa (job #590426) | Cod sursa (job #2330042) | Cod sursa (job #1115752) | Cod sursa (job #1090554) | Cod sursa (job #7363)
Cod sursa(job #7363)
#include <stdio.h>
#define NMAX 1000
int a[NMAX][NMAX], n, m;
unsigned long count;
void read()
{
int i, x, y;
scanf("%d %d\n", &n, &m);
for(i = 1; i <= m; ++i)
{
scanf("%d %d\n", &x, &y);
a[x][y] = a[y][x] = 1;
}
}
void parcurgere()
{
int i, j, k;
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
if(a[i][j] && i != j)
{
for(k = 1; k <= n; ++k)
if(a[i][k] && i != k && j != k)
{
++count;
a[k][j] = 0;
}
}
}
}
int main()
{
int i;
freopen("triplete.in", "r", stdin);
freopen("triplete.out", "w", stdout);
read();
parcurgere();
printf("%lu\n", count-3*(count/4));
fclose(stdin);
fclose(stdout);
return 0;
}