Pagini recente » Cod sursa (job #2719085) | Cod sursa (job #1279436) | Monitorul de evaluare | Cod sursa (job #1258893) | Cod sursa (job #183835)
Cod sursa(job #183835)
#include <cstdio>
#define Nmax 9001
#define Xmax 7001
int V[Nmax], N,w[Xmax];
void citire()
{
scanf("%d",&N);
for(int i=0; i<N; i++)
scanf("%d",V+i);
}
void solve()
{
long nr = 0;
int m;
for(int i=0; i<N; i++)
w[V[i]]++;
for(int i=0; i<N-1; i++)
for(int j=i+1; j<N; j++)
if(!((V[i] + V[j]) & 1 ) && w[m = (V[i] + V[j]) >> 1])
nr += (V[i] == V[j])? w[m] - 2 : w[m];
printf("%ld\n",nr);
}
int main()
{
freopen("medie.in","r",stdin);
freopen("medie.out","w",stdout);
citire();
solve();
}