Pagini recente » Cod sursa (job #2001259) | Istoria paginii runda/9_martie_simulare_oji_2024_clasele_11_12 | Cod sursa (job #1656786) | Cod sursa (job #1325697) | Cod sursa (job #195832)
Cod sursa(job #195832)
#include<stdio.h>
#define NMAX 2845
int main(){
freopen("triplete.in","r",stdin);
freopen("triplete.out","w",stdout);
char a[NMAX+1][NMAX+1];
int n,m,i,j,k,l,c,nrtr=0,t;
scanf("%d%d",&n,&m);
for(i=0;i<=n;++i)
for(j=0;j<=n;++j) a[i][j]=0;
for(i=1;i<=m;++i){
scanf("%d%d",&l,&c);
if(l>c) {t=l;l=c;c=t;}
a[l][c]=1;
}
for(i=1;i<n-1;++i)
for(j=i+1;j<n;++j)
if(a[i][j])
for(k=j+1;k<=n;++k)
if(a[i][k]&&a[j][k]) {nrtr++;/*printf("%d%d%d\n",i,j,k);*/}
printf("%d",nrtr);
return 0;
}