Cod sursa(job #3224508)
| Utilizator | Data | 15 aprilie 2024 15:59:50 | |
|---|---|---|---|
| Problema | Medie | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
int fr1[7002], fr2[7002];
int n, i, j, k, a[9002];
long long r;
int main() {
fin.tie(nullptr);
fout.tie(nullptr);
fin >> n;
for(i = 1; i <= n; i++) {
fin >> a[i];
fr1[a[i]]++;
for(j = 1; j < i; j++) {
if((a[i] + a[j]) % 2 == 0) fr2[(a[i] + a[j]) / 2]++;
}
}
for(i = 1; i <= n; i++) r += fr2[a[i]] - fr1[a[i]] + 1;
fout << r;
return 0;
}
