Pagini recente » Cod sursa (job #400771) | Cod sursa (job #2506346) | Cod sursa (job #2533361) | Cod sursa (job #775) | Cod sursa (job #39453)
Cod sursa(job #39453)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("triplete.in");
ofstream out("triplete.out");
int n, m;
//void read()
//{
// in >> N >> M;
// int x, y;
// for ( int i = 0; i < M; ++i )
// {
// in >> x >> y;
// a[x-1][y-1] = a[y-1][x-1] = 1;
// }
//}
//
//void printmat()
//{
// for ( int i = 0; i < N; ++i )
// {
// for ( int j = 0; j < N; ++j )
// cout << a[i][j] << " ";
// cout << endl;
// }
//}
//
//void rez()
//{
// int cnt = 0;
// for ( int i = 0; i < N; ++i )
// for ( int j = i; j < N; ++j )
// for ( int k = j; k < N; ++k )
// {
// if ( a[i][j] == 1 && a[i][j] == a[i][k] && a[j][k] == a[i][k] )
// ++cnt;
// }
//
// out << cnt << endl;
//}
//
void rezbiti()
{
unsigned int a[409][128] = {{0}};
in >> n >> m;
struct perechi
{
unsigned short a, b;
};
perechi b[65536];
for ( int i = 0; i < m; ++i )
{
in >> b[i].a >> b[i].b;
b[i].a -= 1;
b[i].b -= 1;
a[b[i].a][b[i].b/32] |= (1<<(b[i].b%32));
a[b[i].b][b[i].a/32] |= (1<<(b[i].a%32));
}
int cnt = 0;
for ( int i = 0; i < m; ++i )
{
for ( int j = 0; j <= n/32; ++j )
{
for ( int biti = 0; biti < 32; ++biti )
{
cnt += (a[b[i].a][j] & a[b[i].b][j] & (1<<biti)) != 0;
}
}
}
out << cnt/3 << endl;
}
int main()
{
//read();
//printmat();
rezbiti();
return 0;
}