Cod sursa(job #640380)
Utilizator | Data | 25 noiembrie 2011 16:08:16 | |
---|---|---|---|
Problema | Medie | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#define DN 9005
using namespace std;
int n,v[DN],aparitii[DN];
int main()
{
ifstream f("medie.in");
ofstream g("medie.out");
int i;
f>>n;
for(i=1; i<=n;++i) {
f>>v[i];
++aparitii[v[i]];
}
int rez=0;
for(i=2; i<=n;++i) for(int j=1; j<i; ++j) {
int sum=v[i]+v[j];
if(0==sum%2){
rez+=aparitii[sum/2];
if(v[i]==v[j]) rez-=2;
}
}
g<<rez;
return 0;
}