Cod sursa(job #3164260)
Utilizator | Data | 2 noiembrie 2023 16:02:41 | |
---|---|---|---|
Problema | Medie | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
int v[9005];
int main()
{
int n;
f>>n;
int i;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
int j,k;
int nr=0;
for(i=2;i<=n-1;i++)
{
for(j=1;j<=i;j++)
{
for(k=i+1;k<=n;k++)
if(v[i]==(v[j]+v[k])/2 && (v[j]+v[k])%2==0)
nr++;
}
}
g<<nr;
return 0;
}