Cod sursa(job #1390778)
Utilizator | Iacob Paul Cristian crysstyan | Data | 17 martie 2015 12:29:56 |
---|---|---|---|
Problema | Medie | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
int rez=0,i,n,j,k,v[9001],ap[7001];
int main()
{
f>>n;
for (i=1; i<=n; ++i) f>>v[i];
for (i=1; i<=n; ++i)
for (j=1; j<=i-1; ++j)
{
if ((v[i]+v[j])%2==0)
ap[(v[i]+v[j])/2]++;
if ((v[i]+v[j])/2==v[i]) rez-=2;
}
for (i=1; i<=n; ++i) rez+=ap[v[i]];
g<<rez<<'\n';
return 0;
}