Pagini recente » Cod sursa (job #164688) | Borderou de evaluare (job #2210080) | Cod sursa (job #2408469) | Cod sursa (job #1039578) | Cod sursa (job #476338)
Cod sursa(job #476338)
#include<fstream>
#include<bitset>
using namespace std;
const char iname[]="triplete.in";
const char oname[]="triplete.out";
const int maxn=4096;
const int maxm=38000;
ifstream f(iname);
ofstream g(oname);
bitset<maxn> a[maxn];
int i,j,n,x,y,m,q[maxm][2];
unsigned int rez;
int main()
{
f>>n>>m;
for(i=0;i<m;++i)
f>>x>>y,a[min(x,y)-1][max(x,y)+1]=1,q[i][0]=x-1,q[i][1]=y-1;
for(i=0;i<m;++i)
rez+=(a[q[i][0]]&a[q[i][1]]).count();
g<<rez<<"\n";
}