Pagini recente » Cod sursa (job #1278867) | Cod sursa (job #2110495) | Cod sursa (job #2535842) | Cod sursa (job #1349631) | Cod sursa (job #1759485)
#include <bits/stdc++.h>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
const int nMax = 4099;
const int mMax = 65536;
bitset <nMax> a[nMax];
int x[mMax],y[mMax];
int main()
{
int n , m;
f>> n >> m;
for(int i = 1; i <= m; i++) {
f>> x[i] >> y[i];
if(x[i] > y[i]) {
swap(x[i],y[i]);
}
a[x[i]][y[i]] = 1;
}
int sol = 0;
for(int i = 1; i <= m; i++) {
sol += (a[x[i]] & a[y[i]]).count();
}
g<< sol << "\n";
return 0;
}