Pagini recente » Cod sursa (job #694528) | Cod sursa (job #2462687) | Cod sursa (job #484421) | Cod sursa (job #817541) | Cod sursa (job #757299)
Cod sursa(job #757299)
#include <fstream>
#include <iostream>
using namespace std;
#define nmax 4099
ifstream f("triplete.in");
ofstream g("triplete.out");
int n, m, a[nmax][nmax];
void citeste(){
f >> n >> m;
for(int i=1; i<=m; i++){
int x, y;
f >> x >> y;
a[x][y] = 1;
a[y][x] = 1;
}
}
void rezolva(){
int cnt = 0;
for(int i=1; i<=n-2; i++){
for(int j=i+1; j<=n-1; j++){
if (a[i][j] == 0) continue;
for(int k=j+1; k<=n; k++){
if (a[i][j] && a[i][k] && a[j][k]) ++ cnt;
}
}
}
cout << cnt << "\n";
g << cnt << "\n";
}
int main(){
citeste();
rezolva();
f.close();
g.close();
return 0;
}