Pagini recente » Cod sursa (job #21786) | Cod sursa (job #2577561) | Cod sursa (job #2654875) | Cod sursa (job #2934481) | Cod sursa (job #1786758)
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
int f[4100], n, m, x, y;
long long sol = 0;
vector<int> v[4100];
int main(){
fin >> n >> m;
for( int i = 1; i <= m; i++ ){
fin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
sol = 0;
for( int i = 1; i <= n; i++ ){
memset( f, 0, sizeof(f) );
for( int j = 0; j < v[i].size(); j++ ){
f[ v[i][j] ] = 1;
}
for( int j = 0; j < v[i].size(); j++ ){
int nod = v[i][j];
if( nod > i ){
for( int k = 0; k < v[nod].size(); k++ ){
int vecin = v[nod][k];
if( vecin > nod && f[vecin] == 1 ){
sol++;
}
}
}
}
}
fout << sol;
return 0;
}