Cod sursa(job #2677929)
Utilizator | Gaspar Robert Andrei gasparrobert95 | Data | 27 noiembrie 2020 18:48:36 |
---|---|---|---|
Problema | Medie | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define ll long long
#define MOD 9001
using namespace std;
ifstream fin("medie.in");
ofstream fout("medie.out");
ll triplete, n, v[9005], fv[7005];
int main() {
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
for (int p = 1; p <= n; ++p)
for (int i = 1; i <= n; ++i)
for (int j = 1; i != p && j < i; ++j)
if (j != p && v[p] * 2 == v[i] + v[j])
++triplete;
fout << triplete;
return 0;
}