Pagini recente » Istoria paginii preoni-2007/clasament/runda-1/10 | Cod sursa (job #14458) | Monitorul de evaluare | Cod sursa (job #1723489) | Cod sursa (job #262145)
Cod sursa(job #262145)
#include <stdio.h>
int a[9001];
int aparitii[7001];
int N;
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]] += 1;
}
int sum = 0;
int tot = 0;
for (int i = 0; i < N - 1; i++)
{
for (int j = i + 1 ; j < N ; j++)
{
sum = a[i] + a[j];
if (sum % 2 == 0)
{
sum = sum / 2;
if (a[i] == sum)
tot += aparitii[sum] - 2;
else
tot += aparitii[sum];
}
}
}
printf("%d", tot);
return 0;
}