Pagini recente » Cod sursa (job #1025943) | Cod sursa (job #1981763) | Cod sursa (job #426770) | Cod sursa (job #3160643) | Cod sursa (job #3126007)
#include<iostream>
#include<fstream>
#include<map>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
int n,v[9005];
map<int,int> m;
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
m[v[i]*2]++;
}
}
void solve()
{
int cnt = 0;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
cnt+=max(0,m[v[i] + v[j]] - 2*(v[i] == v[j]));
g<<cnt;
}
int main()
{
citire();
solve();
}