Pagini recente » Cod sursa (job #2669270) | Cod sursa (job #683125) | Cod sursa (job #2769268) | Cod sursa (job #1313162) | Cod sursa (job #617646)
Cod sursa(job #617646)
#include<fstream>
#include<bitset>
#include<cstdio>
#include<cstring>
using namespace std;
int m,sol;
short n,A[66000],B[66000];
bitset <4100> G[4100],nr;
int main()
{
int i;
short j,lim,x,y;
char s[15];
freopen("triplete.in","r",stdin);
gets(s);
j=0;
lim=strlen(s);
while(s[j]!=' ')
{
n=n*10+(s[j]-'0');
j++;
}
j++;
while(j<lim)
{
m=m*10+(s[j]-'0');
j++;
}
for(i=1;i<=m;i++)
{
gets(s);
j=x=y=0;
lim=strlen(s);
while(s[j]!=' ')
{
x=x*10+(s[j]-'0');
j++;
}
j++;
while(j<lim)
{
y=y*10+(s[j]-'0');
j++;
}
if(x<y)
G[x].set(y);
else
G[y].set(x);
A[i]=x; B[i]=y;
}
for(i=1;i<=m;i++)
{
nr=(G[A[i]]&G[B[i]]);
sol+=nr.count();
}
freopen("triplete.out","w",stdout);
printf("%d\n",sol);
return 0;
}