Pagini recente » Cod sursa (job #2266453) | Cod sursa (job #3270887) | Cod sursa (job #2559012) | Cod sursa (job #3292121) | Cod sursa (job #6904)
Cod sursa(job #6904)
#include <cstdio>
#define FIN "triplete.in"
#define FOUT "triplete.out"
#define MAX_M 65600
#define MAX_N 4100
struct muchie {
long x,y;
};
char A[MAX_N][MAX_N];
muchie L[MAX_M];
long N, M;
long long num;
void load_graph() {
long i;
freopen(FIN, "r", stdin);
scanf("%ld %ld", &N, &M);
for (i=0; i<M; ++i) {
scanf("%ld %ld", &L[i].x, &L[i].y);
A[ L[i].x ][ L[i].y ] =1;
A[ L[i].y ][ L[i].x ] =1;
}
fclose(stdin);
}
void write_answer() {
freopen(FOUT, "w", stdout);
printf("%lld\n", num);
fclose(stdout);
}
void solve1() {
long i,j;
for (i=0; i<M; ++i)
for (j=1; j<=N; ++j)
if ( A[ L[i].x ][j] == 1 && A[ L[i].y ][j] == 1 )
num++;
num/=3;
}
int main() {
load_graph();
solve1();
write_answer();
return 0;
}