Pagini recente » Cod sursa (job #2583568) | Cod sursa (job #2149341) | Cod sursa (job #1881175) | Cod sursa (job #37558) | Cod sursa (job #529745)
Cod sursa(job #529745)
#include<fstream>
#define dmax 66000
#define dmax2 4100
using namespace std;
typedef struct muchie
{
int x,y;
} muchie;
int n,m;
muchie mu[dmax];
bool a[dmax2][dmax2];
long long numar;
void citire()
{
int i;
ifstream fin("triplete.in");
fin>>n>>m;
for (i=1; i<=m; i++)
{
fin>>mu[i].x>>mu[i].y;
a[mu[i].x][mu[i].y] = 1;
a[mu[i].y][mu[i].x] = 1;
}
fin.close();
}
void solve()
{
int i,j;
for (i=1; i<=m; i++)
for (j=1; j<=n; j++)
if (a[mu[i].x][j] == 1 && a[mu[i].y][j] == 1) /*daca exista muchie de la m[i].x la j si de la m[i].y la j*/
numar++;
}
void afisare()
{
ofstream fout("triplete.out");
fout<<numar / 3;
fout.close();
}
int main()
{
citire();
solve();
afisare();
return 0;
}