Pagini recente » Cod sursa (job #1237366) | Profil lavinia.tache | Cod sursa (job #2583514) | Cod sursa (job #944041) | Cod sursa (job #1008232)
#include <fstream>
#include <vector>
#include <bitset>
#include <stdio.h>
using namespace std;
ifstream cin( "triplete.in" );
const int MAXN = 4097;
const int oo = (1<<31)-1;
bitset<MAXN> G[MAXN];
int N, M, X[65537], Y[65537];
int main() {
cin >> N >> M;
for(int i = 0 ; i < M ; ++ i) {
int x, y;
cin >> x >> y;
X[i] = x;
Y[i] = y;
G[x][y] = 1;
G[y][x] = 1;
}
int Ans = 0;
for(int i = 0 ; i < M ; ++ i)
Ans += ((bitset<MAXN>)G[X[i]]&G[Y[i]]).count();
freopen("triplete.out", "w", stdout);
printf("%d\n", (int)Ans/3);
cin.close();
return 0;
}