Pagini recente » Cod sursa (job #585575) | Cod sursa (job #1382948) | Cod sursa (job #2936006) | Cod sursa (job #883607) | Cod sursa (job #1163005)
#include <cstdio>
using namespace std;
int x[10000],y[15000];
int main()
{
int n,i,j,ok,nr,sum,min,max;
FILE *f=fopen("medie.in","r");
FILE *g=fopen("medie.out","w");
fscanf(f,"%d",&n);
min=10000l;
max=0;
for(i=1; i<=n; ++i)
{
fscanf(f,"%d",&x[i]);
++y[x[i]];
if(x[i]<min)
min=x[i];
if(x[i]>max)
max=x[i];
}
i=min;
sum=0;
for(i;i<=7000;++i)
{
sum+=y[i]*(y[i]-1)*(y[i]-2)/2;
for(j=min;j<i;++j)
{
sum+=y[j]*y[2*i-j];
}
}
fprintf(g,"%d",sum);
return 0;
}