Pagini recente » Cod sursa (job #3209723) | Cod sursa (job #2226479) | Cod sursa (job #2721688) | Cod sursa (job #1051261) | Cod sursa (job #2725293)
#include <fstream>
#include <deque>
#include <queue>
#include <algorithm>
using namespace std;
ifstream cin ("medie.in") ;
ofstream cout("medie.out") ;
int v[9001], frecv[7001] ;
int main()
{
int n, rez = 0 ;
cin >> n ;
for(int f = 1 ; f <= n ; f ++)
cin >> v[f], frecv[v[f]] ++ ;
for(int f = 1 ; f <= n ; f ++)
for(int e = f + 1 ; e <= n ; e ++)
if(!((v[f] + v[e]) % 2))rez += frecv[(v[f] + v[e]) / 2] - (v[f] == v[e]) - ((v[f] == ((v[f] + v[e]) / 2)) || (v[e] == ((v[f] + v[e]) / 2))) ;
cout << rez ;
return 0;
}