Cod sursa(job #2876819)
Utilizator | Data | 23 martie 2022 17:32:13 | |
---|---|---|---|
Problema | Medie | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 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];
ap[2*v[i]]++;
}
for(i=1; i<n; i++)
{
for(j=i+1; j<=n; j++)
{
rezultat+=max(ap[v[i]+v[j]]-2*(v[i]==v[j]),0);
///cout<<v[i]<<' '<<v[j]<<' '<<ap[v[i]+v[j]]<<'\n';
}
}
g<<rezultat;
}