Pagini recente » Cod sursa (job #99228) | Cod sursa (job #1311382) | Cod sursa (job #1987351) | Cod sursa (job #2824710) | Cod sursa (job #1326243)
#include <algorithm>
#include <fstream>
using namespace std;
int v[9005], a[9005];
int main()
{ ifstream f("medie.in");
ofstream g("medie.out");
int n, i, j, cont=0;
f>>n;
for (i=1;i<=n;++i)
f>>v[i];
for (i=1;i<=n;++i)
for (j=i+1;j<=n;++j)
if ((v[i]+v[j])%2==0)
{ a[(v[i]+v[j])/2]++;
if ((v[i]+v[j])/2==v[i]) cont--;
if ((v[i]+v[j])/2==v[j]) cont--;
}
for (i=1;i<=n;++i)
cont=cont+a[v[i]];
g<<cont;
return 0;
}