Pagini recente » Cod sursa (job #88382) | Cod sursa (job #1725511) | Cod sursa (job #1311681) | Cod sursa (job #1385885) | Cod sursa (job #2544010)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int n, v[9005], mx, fr[7005], fr2[9005];
long long ans;
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> v[i];
mx = max(mx, v[i]);
fr2[v[i]]++;
}
for (int i = 1; i <= mx; ++i)
{
if (fr2[i] == 0) continue;
for (int j = 1; j <= n; ++j)
{
int x = 2 * i - v[j];
if (x <= 0) continue;
ans += fr[x] * fr2[i];
fr[v[j]]++;
}
for (int j = 1; j <= fr2[i]; ++j)
ans -= (j * (j - 1)) / 2;
for (int j = 1; j <= mx; ++j) fr[j] = 0;
}
fout << ans;
fin.close();
fout.close();
return 0;
}