Pagini recente » Cod sursa (job #1913798) | Cod sursa (job #2400458) | Cod sursa (job #1499028) | Cod sursa (job #999278) | Cod sursa (job #1008221)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
string file = "triplete";
ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );
const int MAXN = 4100;
const int oo = (1<<31)-1;
bitset<MAXN> G[MAXN];
vector< pair<int, int> > Edges;
int N, M;
int main() {
cin >> N >> M;
for(int i = 1 ; i <= M ; ++ i) {
int x, y;
cin >> x >> y;
Edges.push_back(make_pair(x, y));
G[x][y] = 1;
G[y][x] = 1;
}
int Ans = 0;
for(int i = 0 ; i < M ; ++ i) {
int x = Edges[i].first;
int y = Edges[i].second;
Ans += ((bitset<MAXN>)G[x]&G[y]).count();
}
cout << Ans / 3 << '\n';
cin.close();
cout.close();
return 0;
}