Pagini recente » Cod sursa (job #816163) | Solutii Autumn Warmup, Runda 1 | Cod sursa (job #23205) | Cod sursa (job #651601) | Cod sursa (job #129553)
Cod sursa(job #129553)
#include <stdio.h>
int main()
{
int i,j,n,max,nrot;
int a[9010],nr[7010],fol[14010];
freopen("medie.in","r",stdin);
freopen("medie.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=14000; i++)
{
nr[i]=0;
fol[i]=0;
}
for (i=1; i<=n; i++)
{
scanf("%d",&a[i]);
if (a[i]>max) max=a[i];
nr[a[i]]++;
}
for (i=1; i<=n-1; i++)
for (j=i+1; j<=n; j++)
if ((a[i]+a[j])%2==0)
fol[(a[i]+a[j])/2]++;
nrtot=0;
for (i=1; i<=max; i++)
if (fol[i]!=0 && nr[i]!=0) nrtot+=nr[i]*fol[i]-nr[i]*(nr[i]-1);
printf("%lld\n",nrtot);
return 0;
}