Pagini recente » Cod sursa (job #1176822) | Cod sursa (job #452157) | Cod sursa (job #2276015) | Cod sursa (job #1050909) | Cod sursa (job #1873028)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
int a[9001];
int v[7001];
int r[7001];
int main()
{int n,i,j;
int x;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<n;i++)
{
r[a[i]]++;
for(j=i+1;j<=n;j++)
{
x=a[i]+a[j];
if(x%2);
else
v[x/2]++;
}
}
r[a[n]]++;
int nr=0;
for(i=1;i<=n;i++)
nr+=(v[a[i]]-r[a[i]]+1);
g<<nr;
return 0;
}