Pagini recente » Cod sursa (job #2949013) | Cod sursa (job #559336) | Cod sursa (job #802588) | Cod sursa (job #2043551) | Cod sursa (job #3190033)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int n, v[9001], sol, fr[7001];
int main()
{
int i, j, x, y;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> v[i];
fr[v[i]]++;
}
for (i = 1; i < n; i++)
for (j = i + 1; j <= n; j++)
if ((v[i] + v[j]) % 2 == 0)
{
x = (v[i] + v[j]) / 2;
if (v[i] == x && v[j]!=x)fr[v[i]] -= 2;
else if (v[j] == x && v[i]!=x)fr[v[j]] -= 2;
else fr[v[i]] -= 2;
sol += fr[x];
if (v[i] == x && v[j] != x)fr[v[i]] += 2;
else if (v[j] == x && v[i] != x)fr[v[j]] += 2;
else fr[v[i]] += 2;
}
fout << sol;
return 0;
}