Pagini recente » Cod sursa (job #740367) | Cod sursa (job #1617464)
#include <bits/stdc++.h>
#define maxN 65537
#define maxM 4097
using namespace std;
int a[maxM][maxM/32], v[maxN], w[maxN];
int n, m, i, j, sol;
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 cnt(int x)
{
int s = 0;
while(x)
s++, x = x&(x-1);
return s;
}
int main()
{
freopen("triplete.out", "w", stdout);
InputReader f("triplete.in");
f >> n >> m;
for(i = 1; i <= m; i++)
{
f >> v[i] >> w[i];
if(v[i] > w[i]) swap(v[i], w[i]);
a[v[i]][w[i]/32] = a[v[i]][w[i]/32] + (1<<(w[i]%32));
}
int aux = n/32;
for(i = 1; i <= m; i++)
for(j = 0; j <= aux; j++)
sol += cnt(a[v[i]][j] & a[w[i]][j]);
printf("%d", sol);
return 0;
}