Cod sursa(job #1810393)
| Utilizator | Data | 19 noiembrie 2016 23:31:47 | |
|---|---|---|---|
| Problema | Triplete | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
bitset <4097> fnd[4097];
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);
fnd[x][y] = fnd[y][x] = 1;
}
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 (fnd[i][ls[ls[i][j]][k]] == 1)
nr++;
g << nr/6;
return 0;
}
