Pagini recente » Cod sursa (job #3280808) | Cod sursa (job #2678310) | Cod sursa (job #3238171) | Cod sursa (job #1898177) | Cod sursa (job #1941163)
#include<fstream>
#include<bitset>
using namespace std;
int i, j, k, ok, n, m, el, min1, max1, x, y, a, b, rez;
bitset<4100>bit[4100], nr;
int v1[66666], v2[66666];
int main()
{
ifstream f("triplete.in");
ofstream g("triplete.out");
//ifstream f("file.in");
//ofstream g("file.out");
f >> n >> m;
for (i = 1; i <= m; i++)
{
f >> v1[i] >> v2[i];
if(v1[i]>v2[i])
bit[v2[i]].set(v1[i]);
else
bit[v1[i]].set(v2[i]);
}
for (i = 1; i <= m; i++)
{
nr = (bit[v1[i]] & bit[v2[i]]);
rez += nr.count();
}
g << rez<<'\n';
return 0;
}