Pagini recente » Cod sursa (job #1104468) | Cod sursa (job #1835495) | Cod sursa (job #525836) | Cod sursa (job #2443913) | Cod sursa (job #930840)
Cod sursa(job #930840)
#include <fstream>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int n, sum;
int v[9002], a[7002], w[9002];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
{
fin >> v[i];
++a[v[i]];
}
for (int i = 1; i <= n; ++i)
{
for (int j = i + 1; j <= n; ++j)
{
if (((v[i] + v[j]) >> 1) == ((v[i] + v[j] + 1) >> 1))
++w[(v[i] + v[j]) >> 1];
}
}
sum = 0;
for (int i = 1; i <= n; ++i)
{
if (w[v[i]] != 0)
sum += w[v[i]] - a[v[i]] + 1;
}
fout << sum;
fin.close();
fout.close();
return 0;
}