Cod sursa(job #282636)
Utilizator | Data | 17 martie 2009 23:22:42 | |
---|---|---|---|
Problema | Medie | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <stdio.h>
int n,v[9001],m[9001],u[9001],k,i,j;
int main()
{
freopen("medie.in","r",stdin);
freopen("medie.out","w",stdout);
scanf("%d", &n);
for (i=1;i<=n;i++)
{
scanf("%d", &v[i]);
u[v[i]]++;
}
for (i=1;i<n;i++)
for (j=i+1;j<=n;j++)
if (!((v[i]+v[j])&1)) m[(v[i]+v[j])>>1]++;
for (i=1;i<=n;i++)
if (m[v[i]]>0){
k=k+m[v[i]]-u[v[i]];
k++;
}
printf("%d", k);
return 0;
}