Pagini recente » Cod sursa (job #1480575) | Cod sursa (job #2907629) | Cod sursa (job #1368471) | Cod sursa (job #1158551) | Cod sursa (job #2535763)
#include<fstream>
#include<bitset>
using namespace std;
ifstream in("triplete.in");
ofstream out("triplete.out");
const int NMax = 4096;
bitset <NMax+5> G[NMax+5], x;
int N, M, Sol;
void Read () {
in >> N >> M;
for (int i = 0,x,y; i <= M; i++) {
in >> x >> y;
G[x][y] = 1;
G[y][x] = 1;
}
}
void Solve() {
for (int i = 1; i <= N; i++)
for (int j = i+1; j <= N; j++) {
if (G[i][j]) {
x = G[i] & G[j];
Sol += x.count();
}
}
out << Sol / 3 << '\n';
}
int main () {
Read();
Solve();
}