Pagini recente » Cod sursa (job #984803) | Cod sursa (job #2212347) | Cod sursa (job #2352023) | Istoria paginii utilizator/antalkrisztian | Cod sursa (job #1554175)
#include <fstream>
#include <bitset>
#include <utility>
using namespace std;
class InputReader {
public:
InputReader() {}
InputReader(const char *file_name) {
input_file = fopen(file_name, "r");
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
inline InputReader &operator >>(int &n) {
while(buffer[cursor] < '0' || buffer[cursor] > '9') {
advance();
}
n = 0;
while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
n = n * 10 + buffer[cursor] - '0';
advance();
}
return *this;
}
private:
FILE *input_file;
static const int SIZE = 1 << 17;
int cursor;
char buffer[SIZE];
inline void advance() {
++ cursor;
if(cursor == SIZE) {
cursor = 0;
fread(buffer, SIZE, 1, input_file);
}
}
};
const int NMAX = 4136;
const int MMAX = 65605;
bitset <NMAX> graph[NMAX];
pair <int, int> edges[MMAX];
int main()
{
InputReader cin("triplete.in");
ofstream cout("triplete.out");
int n = 0, m = 0;
cin >> n >> m;
for (int i = 1; i <= m; ++ i) {
cin >> edges[i].first >> edges[i].second;
graph[edges[i].first][edges[i].second] = 1;
graph[edges[i].second][edges[i].first] = 1;
}
long long int ans = 0;
for (int i = 1; i <= m; ++ i)
ans += (graph[edges[i].first] & graph[edges[i].second]).count();
cout << ans / 3 << '\n';
//cin.close();
cout.close();
return 0;
}