Pagini recente » Cod sursa (job #2294911) | Cod sursa (job #2167055) | Cod sursa (job #1595329) | Cod sursa (job #390446) | Cod sursa (job #1995614)
//(C) 2017 Andrei Cotor. All rights reserved.
#include<fstream>
#include<bitset>
#include <stdio.h>
#include <ctype.h>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
InParser fi("triplete.in");
ofstream fo("triplete.out");
int n,m,i,A[65537],B[65537];
long long rez;
bitset<4096> P[4096];
bitset<4096> nr;
int main()
{
fi>>n>>m;
for(i=1; i<=m; i++)
{
fi>>A[i]>>B[i];
A[i]--;
B[i]--;
P[A[i]][B[i]]=P[B[i]][A[i]]=1;
}
for(i=1; i<=m; i++)
{
nr=P[A[i]]&P[B[i]];
rez=rez+nr.count();
}
fo<<rez/3<<"\n";
fo.close();
return 0;
}