Pagini recente » Borderou de evaluare (job #698290) | Borderou de evaluare (job #705628) | Cod sursa (job #1810386)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
vector <int> ls[4097];
int nr, n, m,i,j,k,x,y;
int main() {
f >> n >> m;
while (m--) {
f >> x >> y;
ls[x].push_back(y);
ls[y].push_back(x);
}
for (i = 1; i <= n; i++)
for (j = 0; j < ls[i].size(); j++)
for (k = 0; k < ls[ls[i][j]].size(); k++)
if (find(ls[i].begin(), ls[i].end(), ls[ls[i][j]][k]) != ls[i].end())
nr++;
g << nr/6;
return 0;
}