Pagini recente » Cod sursa (job #2226668) | Cod sursa (job #1447811) | Cod sursa (job #2882888) | Cod sursa (job #2198132) | Cod sursa (job #2682888)
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
pair <int, int> much[(1<<16)+1];
bitset <4097> b[4097];
int main()
{
int n, m, i, rasp = 0;
fin >> n >> m;
for (i = 1; i<=m; i++)
{
fin >> much[i].first >> much[i].second;
b[much[i].first][much[i].second] = b[much[i].second][much[i].first] = 1;
}
for (i = 1; i<=m; i++)
rasp = rasp + (b[much[i].first] & b[much[i].second]).count();
fout << rasp/3;
return 0;
}