Pagini recente » Cod sursa (job #690249) | Cod sursa (job #1128708) | Cod sursa (job #102300) | Cod sursa (job #1782534) | Cod sursa (job #720467)
Cod sursa(job #720467)
#include <fstream>
using namespace std;
int n, a[9005], b[7005], c[7005], sol, maxim;
inline void Read()
{
ifstream f("medie.in");
f>>n;
for (int i = 1, x; i<=n; i++)
{
f>>x;
a[i] = x;
c[x]++;
if (x>maxim)
maxim = x;
}
f.close();
}
inline void Solve()
{
int i, j, media;
for (i=1; i<=n; i++)
for (j=i+1; j<=n; j++)
{
if (((a[i]+a[j])&1) == 0)
{
media = ((a[i] + a[j])>>1);
if (a[i] != a[j])
{
b[media] += c[media];
}
else
{
b[media] += (c[media] - 2);
}
}
}
for (i=1; i<=maxim; i++)
sol+=b[i];
}
inline void Write()
{
ofstream g("medie.out");
g<<sol<<"\n";
g.close();
}
int main()
{
Read();
Solve();
Write();
return 0;
}