Pagini recente » Cod sursa (job #2063612) | Cod sursa (job #1837680) | Cod sursa (job #838251) | Cod sursa (job #381502) | Cod sursa (job #76417)
Cod sursa(job #76417)
#include <cstdio>
const int n = 7000;
int v[n+1];
int ret;
void readdata()
{
freopen("medie.in", "r", stdin);
freopen("medie.out", "w", stdout);
int m, tmp;
for (scanf("%d", &m); m; --m)
scanf("%d", &tmp), ++v[tmp];
}
inline int min(int a, int b) { return (a < b ? a : b); }
inline int max(int a, int b) { return (a > b ? a : b); }
void solve()
{
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 (v[i] >= 3)
ret += v[i] * (v[i]-1) * (v[i]-2) * 2;
}
else
ret += v[i] * v[j] * v[2*i-j];
ret /= 2;
printf("%d\n", ret);
}
int main()
{
readdata();
solve();
return 0;
}