Pagini recente » Cod sursa (job #1032040) | Cod sursa (job #301096) | Cod sursa (job #2076443) | Problema satisfiabilității formulelor logice de ordinul doi | Cod sursa (job #341736)
Cod sursa(job #341736)
#include<cstdio>
#include<vector>
using namespace std;
const int N = (1<<12);
unsigned int n;
unsigned char a[N][N>>3];
vector<unsigned int> adj[N];
void citire()
{
unsigned int m,x,y;
scanf("%u%u",&n,&m);
while(m--)
{
scanf("%u%u",&x,&y);
--x;
--y;
a[x][y>>3] |= 1<<(y&7);
a[y][x>>3] |= 1<<(x&7);
adj[x].push_back(y);
}
}
inline unsigned int biti_1(unsigned char x)
{
unsigned int nr=0;
while(x)
{
++nr;
x &= x-1;
}
return nr;
}
unsigned int calcul()
{
unsigned int i,j,k,m,nb=1+(n>>3);
long long nr=0;
for(i=0;i!=n;++i)
for(j=0,m=adj[i].size();j!=m;++j)
for(k=0;k!=nb;++k)
nr+=biti_1(a[i][k]&a[adj[i][j]][k]);
return nr/3;
}
int main()
{
freopen("triplete.in","r",stdin);
freopen("triplete.out","w",stdout);
citire();
printf("%u\n",calcul());
return 0;
}