Cod sursa(job #3153092)
Utilizator | torcea rares [email protected] | Data | 27 septembrie 2023 23:26:57 |
---|---|---|---|
Problema | Medie | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.75 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
int v[9001];
int fr[7001];
int main()
{
int n;
f>>n;
int i;
for(i=1;i<=n;i++)
{
f>>v[i];
fr[v[i]]++;
}
sort(v+1,v+n+1);
int j,k;
int nr=0;
for(i=1;i<n;i++)
{
for(j=1;j<i;j++)
{
if((v[j]+v[n])/2>=v[i])
{
for(k=i+1;k<=n;k++)
if(v[i]==(v[j]+v[k])/2 && 2*v[i]==(v[j]+v[k]))
{
nr=nr+fr[v[k]];
break;
}
}
else
continue;
}
}
g<<nr;
return 0;
}