Pagini recente » Cod sursa (job #849844) | Rating walter (walter) | Monitorul de evaluare | Cod sursa (job #702541) | Cod sursa (job #262157)
Cod sursa(job #262157)
#include <stdio.h>
int a[9001];
int aparitii[7001];
int numarPerElement[9001];
int N, i, j;
int main()
{
freopen ("medie.in","r",stdin);
freopen ("medie.out","w",stdout);
scanf("%d",&N);
int val;
for (int i = 0 ; i < N; i++)
{
scanf("%d",&a[i]);
aparitii[a[i]] ++;
}
int sum = 0;
int tot = 0;
for (i = 0; i < N - 1; i++)
for (j = i + 1 ; j < N ; j++)
if (!((a[i]+a[j])&1))
{
sum = (a[i] + a[j]) >> 1;
if (a[i] == a[j])
tot += aparitii[sum] - 2;
else
tot += aparitii[sum];
}
printf("%d", tot);
return 0;
}