Pagini recente » Cod sursa (job #377069) | Cod sursa (job #2593353) | Cod sursa (job #353587) | Cod sursa (job #455875) | Cod sursa (job #2232196)
#include <bits/stdc++.h>
using namespace std;
int n;
int np[9005], ni[9005], f[9005];
int main()
{
freopen("medie.in", "r", stdin);
freopen("medie.out", "w", stdout);
scanf("%d", &n);
int x, nri = 0, nrp = 0;
long long Sol = 0;
for(int i = 1; i <= n ; ++i){
scanf("%d", &x);
if(x % 2 == 0){
np[++nrp] = x;
for(int i = 1; i < nrp ; ++i){
++f[(np[i] + x) / 2];
if(np[i] + x == x * 2) Sol -= 2;
}
}
else{
ni[++nri] = x;
for(int i = 1; i < nri ; ++i){
++f[(ni[i] + x) / 2];
if(ni[i] + x == x * 2) Sol -= 2;
}
}
}
for(int i = 1; i <= nri ; ++i)
Sol += f[ni[i]];
for(int i = 1; i <= nrp ; ++i)
Sol += f[np[i]];
printf("%lld", Sol);
return 0;
}