Pagini recente » Cod sursa (job #83382) | Cod sursa (job #779416) | Cod sursa (job #2302729) | Cod sursa (job #2096937) | Cod sursa (job #2150959)
#include <fstream>
#include <cstdio>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
const int n = 7000;
int fr[n+1],x,maxim;
long long rez;
int main()
{
int n;
long long sol=0;
f >> n ;
for ( int i = 1 ; i <= n ; i ++ )
{
f >> v[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 )
{
sol+=fr[(v[i]+v[j])/2];
if( v[i] == v[j] )
sol -= 2 ;
}
g << sol ;
}