Pagini recente » Statistici Capsunar (plecinspania) | Istoria paginii runda/aicluj_08-11 | Arhiva de probleme | fmi-no-stress-2012/solutii/costperm | Cod sursa (job #2013441)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("triplete.in");
ofstream fout ("triplete.out");
vector <int> A[4097];
int n, m, B[4097][4097], nr;
int main () {
fin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
fin >> x >> y;
A[x].push_back (y);
A[y].push_back (x);
B[x][y] = 1;
B[y][x] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 0; j < A[i].size (); j++) {
for(int k = 0; k < A[A[i][j]].size (); k++) {
if (i != j && j != k && i != k && B[i][A[A[i][j]][k]])
nr++;
}
}
}
fout << nr / 3;
return 0;
}