Pagini recente » Cod sursa (job #1105617) | Cod sursa (job #2380626) | Cod sursa (job #366116) | Cod sursa (job #489275) | Cod sursa (job #513347)
Cod sursa(job #513347)
#include<fstream>
#include<bitset>
#include<vector>
using namespace std;
const int maxn = 4100;
const int maxm = 66000;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
int i , n , m , ans;
bitset <maxn> a[maxn] , act;
vector < pair <int , int > > e(maxm);
int main()
{
fin >> n >> m;
for( i = 1 ; i <= m ; ++i ) {
fin >> e[i].first >> e[i].second;
e[i].first--;e[i].second--;
a[e[i].first][e[i].second] = a[e[i].second][e[i].first] = 1;
}
for( i = 1 ; i <= m ; ++i ) {
act = a[e[i].first] & a[e[i].second];
ans += act.count();
}
fout << ans / 3;
return 0;
}