Pagini recente » Cod sursa (job #2161580) | Cod sursa (job #2128763) | Cod sursa (job #2315361) | Cod sursa (job #598485) | Cod sursa (job #2138173)
#include <fstream>
#include <cstdio>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
const int n = 7000;
int fr[n+1],x;
long long ret;
int main()
{
freopen("medie.in", "r", stdin);
freopen("medie.out", "w", stdout);
int m, tmp;
for (scanf("%d", &m); m; --m)
scanf("%d", &x), fr[x]++;
int i, j;
for (i = 1; i <= n; ++i)
for (j = max(1, 2*i-n); j <= min(n, 2*i-1); ++j)
if (i == j)
{
if (fr[i] >= 3)
ret += (long long)(fr[i] * (fr[i]-1) * (fr[i]-2));
}
else
ret += (long long)(fr[i] * fr[j] * fr[2*i-j]);
ret /= 2;
printf("%lld\n", ret);
return 0;
}