Pagini recente » Cod sursa (job #915613) | Cod sursa (job #2497304) | Cod sursa (job #2881547) | Cod sursa (job #3167840) | Cod sursa (job #2548109)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int main()
{
int n, mx, fr[7005];
long long ans;
fin >> n;
for (int i = 1; i <= n; ++i)
{
int x;
fin >> x;
fr[x]++;
mx = max(mx, x);
}
for (int i = 1; i <= mx; ++i)
{
int j = 1;
if (i % 2 == 0) j = 2;
while (j < i)
{
ans += fr[i] * fr[j] * fr[(i + j) / 2];
j += 2;
}
ans += (fr[i] - 2) * (fr[i] - 1) * fr[i] / 2;
}
fout << ans;
return 0;
}