Pagini recente » Cod sursa (job #2680752) | Cod sursa (job #2069354) | Cod sursa (job #2295784) | Cod sursa (job #2972037) | Cod sursa (job #1098198)
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <bitset>
#define NMAX 4100
using namespace std;
ifstream in ( "triplete.in" );
ofstream out ( "triplete.out" );
int N , M , Answer ;
bitset < NMAX > Edge[NMAX];
int main ( void )
{
int i , j , first_Animal , second_Animal ;
in >> N >> M ;
for ( i = 1 ; i <= M ; ++i )
{
in >> first_Animal >> second_Animal;
Edge[first_Animal][second_Animal] = Edge[second_Animal][first_Animal] = true ;
}
for ( i = 1 ; i <= N ; ++i )
for ( j = i + 1 ; j <= N ; ++j )
if ( Edge[i][j] )
Answer += ( Edge[i] & Edge[j]).count();
out << Answer/3 << "\n";
in.close();
out.close();
return 0;
}