Pagini recente » Cod sursa (job #3178826) | Cod sursa (job #132229) | Cod sursa (job #749875) | Cod sursa (job #178585) | Cod sursa (job #2514767)
#include <fstream>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int n,i,j,v[9005],f[7005],rest[7005];
int main()
{
fin >> n;
for (i=1; i<=n; i++)
{
fin >> v[i];
f[v[i]]++; rest[v[i]] = v[i]%2;
}
long long sol = 0;
for (i=1; i<n; i++)
for (j=i+1; j<=n; j++)
if (rest[v[i]] == rest[v[j]] && f[(v[i]+v[j])/2])
{
int val = (v[i]+v[j])/2; int ok = 0;
if (v[i] == val)
ok++;
if (v[j] == val)
ok++;
sol += f[val]-ok;
}
fout << sol;
return 0;
}