Pagini recente » Borderou de evaluare (job #520071) | Cod sursa (job #1081600) | Cod sursa (job #2491494)
#include <fstream>
#include <bitset>
#define MAX 65580
#define NMAX 5005
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
struct chestie{
int x, y;
}v[MAX];
bitset<NMAX> vec[NMAX];
int rez;
int main()
{
int n, m;
fin >> n >> m;
for(int i = 1; i <= m; ++i){
fin >> v[i].x >> v[i].y;
if(v[i].y > v[i].x)
swap(v[i].x, v[i].y);
vec[v[i].x][v[i].y] = 1;
}
for(int i = 1; i <= m; ++i)
rez += (vec[v[i].x] & vec[v[i].y]).count();
fout << rez << '\n';
return 0;
}