Cod sursa(job #183494)
| Utilizator | Data | 22 aprilie 2008 11:46:01 | |
|---|---|---|---|
| Problema | Medie | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <cstdio>
#include <algorithm>
#define Nmax 9001
using namespace std;
int v[Nmax],N;
void citire()
{
scanf("%d",&N);
for(int i=0; i<N; i++)
scanf("%d",v+i);
}
void solve()
{
int nr = 0;
sort(v,v+N);
for(int i=0; i<N-1; i++)
for(int j=i+1; j<N; j++)
for(int k = 0; k<N; k++)
if((v[k] << 1) == v[i] + v[j] && k!=i && k!=j)
nr++;
printf("%d\n",nr);
}
int main()
{
freopen("medie.in","r",stdin);
freopen("medie.out","w",stdout);
citire();
solve();
}
