Cod sursa(job #2876805)
Utilizator | Data | 23 martie 2022 17:09:47 | |
---|---|---|---|
Problema | Medie | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("medie.in");
ofstream g("medie.out");
int v[10000];
int ap[20000];
int main()
{
int n,rezultat=0,i,j;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if((v[i]+v[j])%2==0)
ap[(v[i]+v[j])/2]++;
for(i=1;i<=n;i++)
if(ap[v[i]]>0)
rezultat+=ap[v[i]];
g<<rezultat;
}