Cod sursa(job #2558453)
| Utilizator | Data | 26 februarie 2020 16:28:21 | |
|---|---|---|---|
| Problema | Triplete | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define MOD 104659
#define ull unsigned long long
using namespace std;
ifstream fin("numere.in");
ofstream fout("numere.out");
bitset<4100> mat[4100];
int p1[65540];
int p2[65540];
int n,m;
int main()
{
int a,b,i,j,r,sum = 0,k;
fin>>n>>m;
for(i = 1; i <= m; i++){
fin>>a>>b;
mat[a][b] = 1;
mat[b][a] = 1;
p1[i] = a;
p2[i] = b;
}
for(i = 1; i <= m; i++){
a=p1[i];
b=p2[i];
sum += (mat[a]&mat[b]).count();
}
fout<<sum/3<<'\n';
return 0;
}
