Pagini recente » Cod sursa (job #236625) | Cod sursa (job #486416) | Cod sursa (job #53529) | Cod sursa (job #1695619) | Cod sursa (job #927210)
Cod sursa(job #927210)
#include <fstream>
#include <algorithm>
#include <iostream>
using namespace std;
#define in "medie.in"
#define out "medie.out"
#define N 9005
short v[N], n, f[N];
long long sol;
int main ()
{
ifstream fin (in);
fin >> n;
for (int i = 0; i < n; ++i)
fin >> v[i], f[v[i]]++;
fin.close();
for (int i = 0; i < n; ++i)
for (int j = i + 1; j < n; ++j)
if (!((v[i] + v[j]) & 1)) {
short medie = (v[i] + v[j]) >> 1;
if (f[medie]) {
if (v[i] == v[j])
sol += (f[medie] - 2);
else
sol += f[medie];
}
}
ofstream fout (out);
fout << sol;
fout.close();
return 0;
}