Cod sursa(job #2983521)
Utilizator | Robert Mitri Robert_Mitri | Data | 22 februarie 2023 16:23:48 |
---|---|---|---|
Problema | Medie | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int n;
int f[8000];
int v[7500];
long long sol;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>v[i];
f[v[i]]++;
}
for(int i = 1; i<=n; i++)
{
for(int j=i+1; j<=n; j++)
{
if((v[i]+v[j])%2==0)
{
int nr = f[(v[i]+v[j])/2];
if(v[i]==v[j])
{
nr-=2;
}
sol+=max(0,nr);
}
}
}
fout<< sol;
}