Pagini recente » Cod sursa (job #2029657) | Cod sursa (job #2325925) | Cod sursa (job #2079638) | Cod sursa (job #727066) | Cod sursa (job #1488165)
#include <cstdio>
#include <algorithm>
#define DIM1 4100
#define DIM2 66000
#define BASE 32
using namespace std;
int N, M, X, Y, sol;
int V[DIM2], W[DIM2];
int A[DIM1][DIM1/BASE];
inline int ub(int X){
int nr = 0;
while(X != 0){
nr ++;
X = (X & (X - 1));
}
return nr;
}
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);
}
}
};
int main(){
InputReader cin("triplete.in");
freopen("triplete.out","w", stdout);
//scanf("%d %d", &N, &M);
cin >> N >> M;
for(int i = 1; i <= M; i ++){
//scanf("%d %d", &V[i], &W[i]);
cin >> V[i] >> W[i];
if(V[i] > W[i])
swap(V[i], W[i]);
A[V[i]][W[i] / BASE] += (1 << (W[i] % BASE));
}
for(int i = 1; i <= M; i ++){
for(int j = 0; j <= N / BASE; j ++)
sol += ub( A[ V[i] ][j] & A[ W[i] ][j] );
}
printf("%d\n", sol);
fclose(stdin );
fclose(stdout);
return 0;
}