Pagini recente » Cod sursa (job #1225779) | Cod sursa (job #2646983) | Cod sursa (job #409489) | Cod sursa (job #2830661) | Cod sursa (job #2525746)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f ( "medie.in" );
ofstream g ( "medie.out" );
int n,v[9005];
int fr[7005];
int medi[7005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
fr[v[i]]++;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if( (v[i]+v[j])%2 == 0 )
medi[(v[i]+v[j])/2]++;
int ans=0;
for(int i=1;i<=n;i++)
ans+= medi[v[i]]- fr[v[i]]+1;
g<<ans;
return 0;
}